./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/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 70142fc261543b4951115471830b502e8a88ca6e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:03:58,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:03:58,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:03:58,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:03:58,966 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:03:58,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:03:58,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:03:58,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:03:58,970 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:03:58,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:03:58,971 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:03:58,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:03:58,972 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:03:58,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:03:58,973 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:03:58,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:03:58,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:03:58,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:03:58,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:03:58,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:03:58,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:03:58,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:03:58,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:03:58,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:03:58,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:03:58,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:03:58,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:03:58,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:03:58,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:03:58,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:03:58,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:03:58,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:03:58,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:03:58,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:03:58,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:03:58,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:03:58,986 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:03:58,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:03:58,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:03:58,994 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:03:58,995 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:03:58,995 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:03:58,995 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:03:58,995 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:03:58,995 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:03:58,995 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:03:58,995 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:03:58,995 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:03:58,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:03:58,996 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:03:58,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:03:58,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:03:58,996 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:03:58,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:03:58,996 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:03:58,997 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:03:58,997 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:03:58,997 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:03:58,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:03:58,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:03:58,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:03:58,997 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:03:58,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:03:58,998 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:03:58,998 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:03:58,998 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:03:58,999 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_443f6416-c9f1-4d62-926f-f5aea42c4788/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 -> 70142fc261543b4951115471830b502e8a88ca6e [2018-11-23 06:03:59,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:03:59,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:03:59,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:03:59,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:03:59,036 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:03:59,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i [2018-11-23 06:03:59,087 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/data/3ab86ef03/0408270379ac4b349bc4a0bf82772c79/FLAGad7c062c5 [2018-11-23 06:03:59,446 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:03:59,447 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i [2018-11-23 06:03:59,455 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/data/3ab86ef03/0408270379ac4b349bc4a0bf82772c79/FLAGad7c062c5 [2018-11-23 06:03:59,465 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/data/3ab86ef03/0408270379ac4b349bc4a0bf82772c79 [2018-11-23 06:03:59,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:03:59,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:03:59,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:03:59,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:03:59,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:03:59,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8308fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59, skipping insertion in model container [2018-11-23 06:03:59,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:03:59,519 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:03:59,732 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:03:59,740 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:03:59,812 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:03:59,834 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:03:59,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59 WrapperNode [2018-11-23 06:03:59,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:03:59,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:03:59,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:03:59,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:03:59,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:03:59,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:03:59,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:03:59,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:03:59,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... [2018-11-23 06:03:59,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:03:59,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:03:59,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:03:59,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:03:59,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/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-11-23 06:03:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:03:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:03:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:03:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:03:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:03:59,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:04:00,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:04:00,110 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 06:04:00,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:04:00 BoogieIcfgContainer [2018-11-23 06:04:00,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:04:00,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:04:00,111 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:04:00,114 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:04:00,115 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:04:00,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:03:59" (1/3) ... [2018-11-23 06:04:00,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d7af5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:04:00, skipping insertion in model container [2018-11-23 06:04:00,116 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:04:00,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:03:59" (2/3) ... [2018-11-23 06:04:00,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d7af5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:04:00, skipping insertion in model container [2018-11-23 06:04:00,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:04:00,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:04:00" (3/3) ... [2018-11-23 06:04:00,118 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-termination.c.i [2018-11-23 06:04:00,150 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:04:00,150 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:04:00,150 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:04:00,150 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:04:00,150 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:04:00,151 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:04:00,151 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:04:00,151 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:04:00,151 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:04:00,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-23 06:04:00,175 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 06:04:00,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:00,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:00,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:04:00,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:04:00,181 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:04:00,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-23 06:04:00,182 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 06:04:00,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:00,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:00,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:04:00,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:04:00,189 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8#L565true assume !(main_~array_size~0 < 1); 14#L565-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 23#L552-3true [2018-11-23 06:04:00,190 INFO L796 eck$LassoCheckResult]: Loop: 23#L552-3true assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20#L552-2true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 23#L552-3true [2018-11-23 06:04:00,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-23 06:04:00,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:00,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:00,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:00,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:00,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:00,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2018-11-23 06:04:00,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:00,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:00,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:00,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:00,294 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2018-11-23 06:04:00,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:00,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:00,626 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:00,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:00,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:00,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:00,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:00,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:00,628 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:00,628 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:00,628 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 06:04:00,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:00,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:00,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,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-11-23 06:04:00,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-11-23 06:04:00,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-11-23 06:04:00,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,873 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-11-23 06:04:00,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:00,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-11-23 06:04:00,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-11-23 06:04:01,244 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:01,247 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:01,248 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-11-23 06:04:01,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,254 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-11-23 06:04:01,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:01,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:01,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,260 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-11-23 06:04:01,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,262 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-11-23 06:04:01,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:01,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:01,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,269 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-11-23 06:04:01,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,271 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-11-23 06:04:01,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,273 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-11-23 06:04:01,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:01,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:01,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,278 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-11-23 06:04:01,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,280 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-11-23 06:04:01,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,283 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-11-23 06:04:01,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,285 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-11-23 06:04:01,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,287 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-11-23 06:04:01,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,289 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-11-23 06:04:01,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:01,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:01,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,296 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-11-23 06:04:01,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,299 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-11-23 06:04:01,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,301 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-11-23 06:04:01,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:01,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:01,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,305 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-11-23 06:04:01,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,307 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-11-23 06:04:01,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,310 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-11-23 06:04:01,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,312 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-11-23 06:04:01,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,314 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-11-23 06:04:01,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:01,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:01,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:01,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,316 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-11-23 06:04:01,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:01,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:01,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:01,320 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-11-23 06:04:01,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:01,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:01,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:01,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:01,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:01,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:01,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:01,421 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 06:04:01,421 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 06:04:01,423 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:01,424 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:04:01,425 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:01,425 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~best~0.offset, v_rep(select #length ULTIMATE.start_lis_~best~0.base)_1, ULTIMATE.start_lis_~i~0) = -1*ULTIMATE.start_lis_~best~0.offset + 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_1 - 4*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-23 06:04:01,485 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 06:04:01,493 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:04:01,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:01,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:01,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:01,567 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:04:01,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2018-11-23 06:04:01,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 41 states and 64 transitions. Complement of second has 8 states. [2018-11-23 06:04:01,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:04:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 06:04:01,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 06:04:01,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:01,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 06:04:01,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:01,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-23 06:04:01,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:01,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2018-11-23 06:04:01,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 06:04:01,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2018-11-23 06:04:01,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 06:04:01,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 06:04:01,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2018-11-23 06:04:01,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:04:01,616 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-23 06:04:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2018-11-23 06:04:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 06:04:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 06:04:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-11-23 06:04:01,637 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-23 06:04:01,637 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-11-23 06:04:01,638 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:04:01,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2018-11-23 06:04:01,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 06:04:01,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:01,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:01,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:04:01,639 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:04:01,639 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 183#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 180#L565 assume !(main_~array_size~0 < 1); 181#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 186#L552-3 assume !(lis_~i~0 < lis_~N); 173#L552-4 lis_~i~0 := 1; 174#L554-3 [2018-11-23 06:04:01,640 INFO L796 eck$LassoCheckResult]: Loop: 174#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 184#L555-3 assume !(lis_~j~0 < lis_~i~0); 187#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 174#L554-3 [2018-11-23 06:04:01,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2018-11-23 06:04:01,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:01,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:01,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:01,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:04:01,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:04:01,701 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:01,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2018-11-23 06:04:01,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:01,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:01,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:01,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:01,715 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:01,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:01,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:01,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:01,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:04:01,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:01,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:01,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:01,716 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration2_Loop [2018-11-23 06:04:01,716 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:01,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:01,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:01,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:01,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:01,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:01,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:01,786 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:01,787 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:01,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:01,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:01,819 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:04:01,819 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:01,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:01,823 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:01,839 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:04:01,839 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:01,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:01,844 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:01,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:04:01,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:01,979 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:04:01,981 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:01,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:01,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:01,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:01,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:01,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:01,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:01,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:01,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration2_Loop [2018-11-23 06:04:01,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:01,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:01,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:01,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:02,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:02,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:02,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:02,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:02,056 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:02,057 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-11-23 06:04:02,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:02,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:02,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:02,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:02,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:02,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:02,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:02,062 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-11-23 06:04:02,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:02,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:02,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:02,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:02,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:02,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:02,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:02,066 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-11-23 06:04:02,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:02,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:02,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:02,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:02,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:02,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:02,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:02,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:02,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:04:02,071 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 06:04:02,071 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:02,071 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:04:02,071 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:02,071 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2018-11-23 06:04:02,072 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:04:02,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:02,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:02,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:02,128 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 06:04:02,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-23 06:04:02,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 49 states and 84 transitions. Complement of second has 10 states. [2018-11-23 06:04:02,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:04:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 06:04:02,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 06:04:02,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:02,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 06:04:02,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:02,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 06:04:02,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:02,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2018-11-23 06:04:02,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 06:04:02,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2018-11-23 06:04:02,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 06:04:02,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 06:04:02,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2018-11-23 06:04:02,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:02,198 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 57 transitions. [2018-11-23 06:04:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2018-11-23 06:04:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-11-23 06:04:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 06:04:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-11-23 06:04:02,201 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-11-23 06:04:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:04:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:04:02,203 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2018-11-23 06:04:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:02,237 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2018-11-23 06:04:02,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:04:02,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2018-11-23 06:04:02,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 06:04:02,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2018-11-23 06:04:02,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 06:04:02,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 06:04:02,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-11-23 06:04:02,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:02,239 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-23 06:04:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-11-23 06:04:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 06:04:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 06:04:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-11-23 06:04:02,241 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-11-23 06:04:02,241 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2018-11-23 06:04:02,242 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:04:02,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2018-11-23 06:04:02,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 06:04:02,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:02,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:02,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:02,243 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:02,243 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 367#L565 assume !(main_~array_size~0 < 1); 368#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 375#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 383#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 384#L552-3 assume !(lis_~i~0 < lis_~N); 358#L552-4 lis_~i~0 := 1; 359#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 376#L555-3 [2018-11-23 06:04:02,243 INFO L796 eck$LassoCheckResult]: Loop: 376#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 360#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 361#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 369#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 372#L555-3 assume !(lis_~j~0 < lis_~i~0); 378#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 379#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 376#L555-3 [2018-11-23 06:04:02,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2018-11-23 06:04:02,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:02,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:02,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:02,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:02,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:02,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 06:04:02,352 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:02,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2018-11-23 06:04:02,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:02,509 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-23 06:04:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:04:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:04:02,555 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand 8 states. [2018-11-23 06:04:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:02,639 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2018-11-23 06:04:02,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:04:02,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2018-11-23 06:04:02,641 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:04:02,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2018-11-23 06:04:02,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 06:04:02,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 06:04:02,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2018-11-23 06:04:02,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:02,642 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 74 transitions. [2018-11-23 06:04:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2018-11-23 06:04:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-11-23 06:04:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 06:04:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-11-23 06:04:02,644 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-23 06:04:02,645 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-23 06:04:02,645 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:04:02,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-11-23 06:04:02,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 06:04:02,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:02,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:02,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:02,646 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:02,646 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 498#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 494#L565 assume !(main_~array_size~0 < 1); 495#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 502#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 512#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 513#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 509#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 510#L552-3 assume !(lis_~i~0 < lis_~N); 485#L552-4 lis_~i~0 := 1; 486#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 503#L555-3 [2018-11-23 06:04:02,646 INFO L796 eck$LassoCheckResult]: Loop: 503#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 487#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 488#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 496#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 499#L555-3 assume !(lis_~j~0 < lis_~i~0); 505#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 506#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 503#L555-3 [2018-11-23 06:04:02,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2018-11-23 06:04:02,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:02,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2018-11-23 06:04:02,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:02,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2018-11-23 06:04:02,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:02,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:02,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:02,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:02,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:02,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:02,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:04:02,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:02,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-23 06:04:03,029 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2018-11-23 06:04:03,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:04:03,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-23 06:04:03,067 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand 14 states. [2018-11-23 06:04:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:03,257 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2018-11-23 06:04:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 06:04:03,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 151 transitions. [2018-11-23 06:04:03,260 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2018-11-23 06:04:03,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 87 states and 126 transitions. [2018-11-23 06:04:03,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-23 06:04:03,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-23 06:04:03,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 126 transitions. [2018-11-23 06:04:03,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:03,261 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 126 transitions. [2018-11-23 06:04:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 126 transitions. [2018-11-23 06:04:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2018-11-23 06:04:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 06:04:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-11-23 06:04:03,265 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-23 06:04:03,265 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-23 06:04:03,266 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:04:03,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-11-23 06:04:03,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:04:03,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:03,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:03,267 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:03,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:04:03,267 INFO L794 eck$LassoCheckResult]: Stem: 725#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 722#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 717#L565 assume !(main_~array_size~0 < 1); 718#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 726#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 736#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 737#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 738#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 744#L552-3 assume !(lis_~i~0 < lis_~N); 743#L552-4 lis_~i~0 := 1; 734#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 723#L555-3 [2018-11-23 06:04:03,267 INFO L796 eck$LassoCheckResult]: Loop: 723#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 746#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 719#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 720#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 723#L555-3 [2018-11-23 06:04:03,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2018-11-23 06:04:03,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:03,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:03,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:03,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:03,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2018-11-23 06:04:03,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:03,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:03,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:03,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2018-11-23 06:04:03,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:03,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:03,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:03,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:03,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:03,485 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-11-23 06:04:03,777 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2018-11-23 06:04:03,872 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:03,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:03,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:03,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:03,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:03,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:03,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:03,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:03,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 06:04:03,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:03,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:03,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:03,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:04,322 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-11-23 06:04:04,472 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-23 06:04:04,638 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-11-23 06:04:04,896 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:04,896 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:04,896 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-11-23 06:04:04,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,901 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-11-23 06:04:04,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,903 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-11-23 06:04:04,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,904 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-11-23 06:04:04,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,911 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-11-23 06:04:04,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,913 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-11-23 06:04:04,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,918 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-11-23 06:04:04,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,919 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-11-23 06:04:04,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,922 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-11-23 06:04:04,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,926 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-11-23 06:04:04,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,928 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-11-23 06:04:04,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,930 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-11-23 06:04:04,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,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-11-23 06:04:04,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,934 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-11-23 06:04:04,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,936 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-11-23 06:04:04,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,939 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-11-23 06:04:04,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,939 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:04:04,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,940 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:04:04,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,943 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-11-23 06:04:04,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,947 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-11-23 06:04:04,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:04,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:04,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:04,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,950 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-11-23 06:04:04,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,950 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:04:04,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,951 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:04:04,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:04,955 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-11-23 06:04:04,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:04,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:04,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:04,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:04,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:04,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:04,991 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:05,045 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 06:04:05,045 INFO L444 ModelExtractionUtils]: 56 out of 64 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 06:04:05,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:05,046 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:04:05,047 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:05,047 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 1 Supporting invariants [] [2018-11-23 06:04:05,187 INFO L297 tatePredicateManager]: 40 out of 43 supporting invariants were superfluous and have been removed [2018-11-23 06:04:05,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:05,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:05,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:05,383 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 06:04:05,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-23 06:04:05,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 65 states and 98 transitions. Complement of second has 9 states. [2018-11-23 06:04:05,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:04:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-23 06:04:05,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 06:04:05,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:05,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 06:04:05,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:05,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-23 06:04:05,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:05,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 98 transitions. [2018-11-23 06:04:05,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 06:04:05,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 46 states and 67 transitions. [2018-11-23 06:04:05,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 06:04:05,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 06:04:05,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 67 transitions. [2018-11-23 06:04:05,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:05,445 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2018-11-23 06:04:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 67 transitions. [2018-11-23 06:04:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-11-23 06:04:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 06:04:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2018-11-23 06:04:05,447 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-23 06:04:05,447 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-23 06:04:05,447 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:04:05,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2018-11-23 06:04:05,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 06:04:05,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:05,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:05,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:05,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:05,448 INFO L794 eck$LassoCheckResult]: Stem: 1080#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1077#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1073#L565 assume !(main_~array_size~0 < 1); 1074#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1081#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1091#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1092#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1093#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1097#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1095#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1094#L552-3 assume !(lis_~i~0 < lis_~N); 1064#L552-4 lis_~i~0 := 1; 1065#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1083#L555-3 assume !(lis_~j~0 < lis_~i~0); 1084#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1098#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L555-3 [2018-11-23 06:04:05,448 INFO L796 eck$LassoCheckResult]: Loop: 1096#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1066#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1067#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1075#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1078#L555-3 assume !(lis_~j~0 < lis_~i~0); 1086#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1087#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1096#L555-3 [2018-11-23 06:04:05,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2018-11-23 06:04:05,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:05,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 06:04:05,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:04:05,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:04:05,472 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:05,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2018-11-23 06:04:05,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:05,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:05,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:05,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:05,645 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-23 06:04:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:04:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:04:05,703 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-11-23 06:04:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:05,725 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2018-11-23 06:04:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:04:05,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. [2018-11-23 06:04:05,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 06:04:05,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 75 transitions. [2018-11-23 06:04:05,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 06:04:05,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 06:04:05,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 75 transitions. [2018-11-23 06:04:05,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:05,727 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 75 transitions. [2018-11-23 06:04:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 75 transitions. [2018-11-23 06:04:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-11-23 06:04:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 06:04:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-11-23 06:04:05,729 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-23 06:04:05,729 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-23 06:04:05,729 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:04:05,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2018-11-23 06:04:05,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 06:04:05,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:05,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:05,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:05,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:05,730 INFO L794 eck$LassoCheckResult]: Stem: 1176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1173#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1169#L565 assume !(main_~array_size~0 < 1); 1170#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1177#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1186#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1187#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1189#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1192#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1191#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1190#L552-3 assume !(lis_~i~0 < lis_~N); 1160#L552-4 lis_~i~0 := 1; 1161#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1178#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1179#L556 assume !lis_#t~short11; 1198#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 1197#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1196#L555-3 assume !(lis_~j~0 < lis_~i~0); 1181#L554-2 [2018-11-23 06:04:05,730 INFO L796 eck$LassoCheckResult]: Loop: 1181#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1182#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1193#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1164#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1165#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1171#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1174#L555-3 assume !(lis_~j~0 < lis_~i~0); 1181#L554-2 [2018-11-23 06:04:05,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 1 times [2018-11-23 06:04:05,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:05,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:05,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 828228918, now seen corresponding path program 4 times [2018-11-23 06:04:05,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:05,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash -257841211, now seen corresponding path program 1 times [2018-11-23 06:04:05,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:05,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 06:04:05,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:05,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:05,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:05,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 06:04:05,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:05,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-23 06:04:06,042 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-23 06:04:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:04:06,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:04:06,080 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. cyclomatic complexity: 22 Second operand 12 states. [2018-11-23 06:04:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:06,155 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-11-23 06:04:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:04:06,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 82 transitions. [2018-11-23 06:04:06,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 06:04:06,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 37 states and 51 transitions. [2018-11-23 06:04:06,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 06:04:06,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 06:04:06,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2018-11-23 06:04:06,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:04:06,157 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-23 06:04:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2018-11-23 06:04:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-23 06:04:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 06:04:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-23 06:04:06,158 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-23 06:04:06,159 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-11-23 06:04:06,159 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 06:04:06,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2018-11-23 06:04:06,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 06:04:06,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:06,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:06,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:06,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 06:04:06,160 INFO L794 eck$LassoCheckResult]: Stem: 1368#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1364#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1360#L565 assume !(main_~array_size~0 < 1); 1361#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1369#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1373#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1374#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1376#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1379#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1378#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1377#L552-3 assume !(lis_~i~0 < lis_~N); 1351#L552-4 lis_~i~0 := 1; 1352#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1372#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1355#L556 assume !lis_#t~short11; 1356#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 1363#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1367#L555-3 assume !(lis_~j~0 < lis_~i~0); 1370#L554-2 [2018-11-23 06:04:06,160 INFO L796 eck$LassoCheckResult]: Loop: 1370#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1371#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1380#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1383#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1382#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1365#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1366#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1353#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1354#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1362#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1381#L555-3 assume !(lis_~j~0 < lis_~i~0); 1370#L554-2 [2018-11-23 06:04:06,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1306611794, now seen corresponding path program 2 times [2018-11-23 06:04:06,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:06,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:06,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:06,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:06,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:06,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 5 times [2018-11-23 06:04:06,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:06,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:06,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash -193053058, now seen corresponding path program 2 times [2018-11-23 06:04:06,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:06,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:06,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:06,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:06,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:04:06,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:06,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:06,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:04:06,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:04:06,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:04:06,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:06,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:06,752 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 17 treesize of output 29 [2018-11-23 06:04:06,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:06,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:06,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 06:04:06,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-23 06:04:06,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 06:04:06,838 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 12 treesize of output 11 [2018-11-23 06:04:06,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 06:04:06,848 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 12 treesize of output 11 [2018-11-23 06:04:06,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-23 06:04:06,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-23 06:04:06,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:06,907 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 18 treesize of output 27 [2018-11-23 06:04:06,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 06:04:06,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:06,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:06,923 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 06:04:06,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:06,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-11-23 06:04:07,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2018-11-23 06:04:07,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,105 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:07,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 119 [2018-11-23 06:04:07,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:07,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 82 [2018-11-23 06:04:07,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,144 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:07,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:07,146 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2018-11-23 06:04:07,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:07,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:07,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:07,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:07,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:75 [2018-11-23 06:04:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:04:07,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:07,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-11-23 06:04:07,644 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2018-11-23 06:04:07,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 06:04:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-11-23 06:04:07,725 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand 28 states. [2018-11-23 06:04:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:09,352 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2018-11-23 06:04:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 06:04:09,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 134 transitions. [2018-11-23 06:04:09,353 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 42 [2018-11-23 06:04:09,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 134 transitions. [2018-11-23 06:04:09,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-23 06:04:09,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-23 06:04:09,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 134 transitions. [2018-11-23 06:04:09,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:04:09,355 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 134 transitions. [2018-11-23 06:04:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 134 transitions. [2018-11-23 06:04:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 52. [2018-11-23 06:04:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 06:04:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2018-11-23 06:04:09,359 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-23 06:04:09,360 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-23 06:04:09,360 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 06:04:09,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 71 transitions. [2018-11-23 06:04:09,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-23 06:04:09,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:09,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:09,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:09,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 06:04:09,361 INFO L794 eck$LassoCheckResult]: Stem: 1675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1671#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1666#L565 assume !(main_~array_size~0 < 1); 1667#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1676#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1685#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1689#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1683#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1684#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1686#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1687#L552-3 assume !(lis_~i~0 < lis_~N); 1656#L552-4 lis_~i~0 := 1; 1657#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1688#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1660#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1661#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1670#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1674#L555-3 assume !(lis_~j~0 < lis_~i~0); 1678#L554-2 [2018-11-23 06:04:09,361 INFO L796 eck$LassoCheckResult]: Loop: 1678#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1680#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1682#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1696#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1694#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1672#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1673#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1677#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1697#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1668#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1693#L555-3 assume !(lis_~j~0 < lis_~i~0); 1678#L554-2 [2018-11-23 06:04:09,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:09,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1306550290, now seen corresponding path program 1 times [2018-11-23 06:04:09,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:09,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:09,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:09,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:09,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:09,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 6 times [2018-11-23 06:04:09,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:09,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:09,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:09,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2097927870, now seen corresponding path program 2 times [2018-11-23 06:04:09,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:09,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:09,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:09,866 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-11-23 06:04:11,647 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 222 DAG size of output: 165 [2018-11-23 06:04:12,083 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-23 06:04:12,085 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:12,085 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:12,085 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:12,085 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:12,085 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:12,085 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:12,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:12,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:12,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-23 06:04:12,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:12,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:12,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:12,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,271 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 111 [2018-11-23 06:04:13,726 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 116 [2018-11-23 06:04:13,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:13,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:14,148 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:14,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:14,149 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-11-23 06:04:14,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:14,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:14,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:14,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:14,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:14,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:14,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:14,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:14,151 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-11-23 06:04:14,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:14,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:14,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:14,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:14,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:14,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:14,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:14,155 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-11-23 06:04:14,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:14,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:14,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:14,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:14,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:14,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:14,168 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:14,178 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:04:14,178 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 06:04:14,179 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:14,179 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:04:14,179 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:14,179 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1 Supporting invariants [] [2018-11-23 06:04:14,437 INFO L297 tatePredicateManager]: 69 out of 70 supporting invariants were superfluous and have been removed [2018-11-23 06:04:14,439 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:04:14,439 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:04:14,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:14,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:14,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 06:04:14,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:04:14,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 06:04:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:14,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:14,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 85 [2018-11-23 06:04:14,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 70 treesize of output 138 [2018-11-23 06:04:14,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-11-23 06:04:14,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-23 06:04:14,616 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 12 treesize of output 11 [2018-11-23 06:04:14,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-11-23 06:04:14,626 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 12 treesize of output 11 [2018-11-23 06:04:14,626 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,632 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-11-23 06:04:14,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 12 treesize of output 11 [2018-11-23 06:04:14,637 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,643 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 06:04:14,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 06:04:14,681 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:106, output treesize:192 [2018-11-23 06:04:14,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 134 [2018-11-23 06:04:14,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,908 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:14,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 212 [2018-11-23 06:04:14,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:14,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 106 [2018-11-23 06:04:14,949 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 34 treesize of output 18 [2018-11-23 06:04:14,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:14,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:15,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 132 [2018-11-23 06:04:15,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 248 [2018-11-23 06:04:15,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:15,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:15,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 101 [2018-11-23 06:04:15,083 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 34 treesize of output 18 [2018-11-23 06:04:15,083 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:15,090 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:15,099 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:15,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 06:04:15,121 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:303, output treesize:191 [2018-11-23 06:04:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:15,213 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-23 06:04:15,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23 Second operand 12 states. [2018-11-23 06:04:15,539 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 71 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 117 states and 162 transitions. Complement of second has 22 states. [2018-11-23 06:04:15,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 06:04:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 06:04:15,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 11 letters. [2018-11-23 06:04:15,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:15,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 29 letters. Loop has 11 letters. [2018-11-23 06:04:15,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:15,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 18 letters. Loop has 22 letters. [2018-11-23 06:04:15,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:15,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 162 transitions. [2018-11-23 06:04:15,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-23 06:04:15,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 90 states and 121 transitions. [2018-11-23 06:04:15,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 06:04:15,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-23 06:04:15,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 121 transitions. [2018-11-23 06:04:15,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:15,551 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 121 transitions. [2018-11-23 06:04:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 121 transitions. [2018-11-23 06:04:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-11-23 06:04:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 06:04:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-11-23 06:04:15,554 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-23 06:04:15,554 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-23 06:04:15,554 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 06:04:15,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 98 transitions. [2018-11-23 06:04:15,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-23 06:04:15,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:15,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:15,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:15,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:04:15,555 INFO L794 eck$LassoCheckResult]: Stem: 2272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2267#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2262#L565 assume !(main_~array_size~0 < 1); 2263#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2273#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2283#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2284#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2286#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2289#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2288#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2287#L552-3 assume !(lis_~i~0 < lis_~N); 2252#L552-4 lis_~i~0 := 1; 2253#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2282#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2256#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2257#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2266#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2295#L555-3 assume !(lis_~j~0 < lis_~i~0); 2293#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2281#L554-3 assume !(lis_~i~0 < lis_~N); 2285#L554-4 lis_~i~0 := 0; 2260#L558-3 [2018-11-23 06:04:15,555 INFO L796 eck$LassoCheckResult]: Loop: 2260#L558-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 2261#L559 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 2259#L558-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 2260#L558-3 [2018-11-23 06:04:15,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1848859483, now seen corresponding path program 1 times [2018-11-23 06:04:15,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:15,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:15,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:15,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:15,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:04:15,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:15,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-23 06:04:15,719 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:15,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash 97415, now seen corresponding path program 1 times [2018-11-23 06:04:15,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 06:04:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-23 06:04:15,743 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. cyclomatic complexity: 31 Second operand 16 states. [2018-11-23 06:04:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:15,875 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2018-11-23 06:04:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 06:04:15,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 141 transitions. [2018-11-23 06:04:15,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-23 06:04:15,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 141 transitions. [2018-11-23 06:04:15,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-23 06:04:15,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-23 06:04:15,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 141 transitions. [2018-11-23 06:04:15,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:15,877 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 141 transitions. [2018-11-23 06:04:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 141 transitions. [2018-11-23 06:04:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2018-11-23 06:04:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 06:04:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2018-11-23 06:04:15,880 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-11-23 06:04:15,880 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-11-23 06:04:15,880 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 06:04:15,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 98 transitions. [2018-11-23 06:04:15,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-23 06:04:15,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:15,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:15,882 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:15,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:15,882 INFO L794 eck$LassoCheckResult]: Stem: 2542#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2537#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2532#L565 assume !(main_~array_size~0 < 1); 2533#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2543#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2553#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2554#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2556#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2559#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2558#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2557#L552-3 assume !(lis_~i~0 < lis_~N); 2523#L552-4 lis_~i~0 := 1; 2524#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2570#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2568#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2565#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2564#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2562#L555-3 assume !(lis_~j~0 < lis_~i~0); 2560#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2551#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2544#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2545#L556 assume !lis_#t~short11; 2534#L556-2 [2018-11-23 06:04:15,882 INFO L796 eck$LassoCheckResult]: Loop: 2534#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 2535#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2581#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2580#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2579#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2577#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2578#L555-3 assume !(lis_~j~0 < lis_~i~0); 2571#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2572#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2593#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2592#L556 assume !lis_#t~short11; 2534#L556-2 [2018-11-23 06:04:15,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1480067810, now seen corresponding path program 1 times [2018-11-23 06:04:15,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 1 times [2018-11-23 06:04:15,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash 183297546, now seen corresponding path program 3 times [2018-11-23 06:04:15,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 06:04:16,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:16,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:16,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:04:16,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 06:04:16,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:04:16,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 06:04:16,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:16,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 06:04:16,456 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-11-23 06:04:16,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 06:04:16,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-11-23 06:04:16,510 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. cyclomatic complexity: 30 Second operand 20 states. [2018-11-23 06:04:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:16,791 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2018-11-23 06:04:16,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 06:04:16,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 187 transitions. [2018-11-23 06:04:16,792 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-23 06:04:16,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 186 transitions. [2018-11-23 06:04:16,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-11-23 06:04:16,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-23 06:04:16,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 186 transitions. [2018-11-23 06:04:16,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:16,793 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 186 transitions. [2018-11-23 06:04:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 186 transitions. [2018-11-23 06:04:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2018-11-23 06:04:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 06:04:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2018-11-23 06:04:16,797 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-11-23 06:04:16,797 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 167 transitions. [2018-11-23 06:04:16,797 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 06:04:16,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 167 transitions. [2018-11-23 06:04:16,798 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-23 06:04:16,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:16,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:16,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:16,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:16,799 INFO L794 eck$LassoCheckResult]: Stem: 2901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2896#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2890#L565 assume !(main_~array_size~0 < 1); 2891#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2902#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2914#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2915#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2912#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2913#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2933#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2932#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2928#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2927#L552-3 assume !(lis_~i~0 < lis_~N); 2929#L552-4 lis_~i~0 := 1; 2931#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2930#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2884#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2885#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2895#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2920#L555-3 assume !(lis_~j~0 < lis_~i~0); 2917#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2918#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3003#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3002#L556 assume !lis_#t~short11; 2968#L556-2 [2018-11-23 06:04:16,799 INFO L796 eck$LassoCheckResult]: Loop: 2968#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 2965#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2995#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2958#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2946#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2947#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2963#L555-3 assume !(lis_~j~0 < lis_~i~0); 2971#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2970#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2969#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2967#L556 assume !lis_#t~short11; 2968#L556-2 [2018-11-23 06:04:16,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:16,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1862607488, now seen corresponding path program 2 times [2018-11-23 06:04:16,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:16,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:16,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:16,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1565507769, now seen corresponding path program 2 times [2018-11-23 06:04:16,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:16,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:16,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:16,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1101378456, now seen corresponding path program 4 times [2018-11-23 06:04:16,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:16,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:16,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 06:04:17,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:17,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:17,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:04:17,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:04:17,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:04:17,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:17,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:17,378 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 17 treesize of output 29 [2018-11-23 06:04:17,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:17,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:17,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 06:04:17,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:17,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:17,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:17,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-23 06:04:17,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2018-11-23 06:04:17,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:17,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:17,492 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 36 [2018-11-23 06:04:17,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:17,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-11-23 06:04:17,507 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 10 treesize of output 9 [2018-11-23 06:04:17,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:17,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:17,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:17,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:17,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:52 [2018-11-23 06:04:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 06:04:17,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:17,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2018-11-23 06:04:18,025 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2018-11-23 06:04:18,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 06:04:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2018-11-23 06:04:18,077 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. cyclomatic complexity: 47 Second operand 30 states. [2018-11-23 06:04:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:19,668 INFO L93 Difference]: Finished difference Result 263 states and 341 transitions. [2018-11-23 06:04:19,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 06:04:19,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 341 transitions. [2018-11-23 06:04:19,670 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 73 [2018-11-23 06:04:19,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 263 states and 341 transitions. [2018-11-23 06:04:19,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2018-11-23 06:04:19,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2018-11-23 06:04:19,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 341 transitions. [2018-11-23 06:04:19,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:19,672 INFO L705 BuchiCegarLoop]: Abstraction has 263 states and 341 transitions. [2018-11-23 06:04:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 341 transitions. [2018-11-23 06:04:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 166. [2018-11-23 06:04:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 06:04:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2018-11-23 06:04:19,676 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 218 transitions. [2018-11-23 06:04:19,676 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 218 transitions. [2018-11-23 06:04:19,676 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 06:04:19,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 218 transitions. [2018-11-23 06:04:19,677 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-23 06:04:19,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:19,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:19,678 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:19,678 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 06:04:19,678 INFO L794 eck$LassoCheckResult]: Stem: 3505#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3500#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3495#L565 assume !(main_~array_size~0 < 1); 3496#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3506#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3519#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3520#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3516#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3517#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3539#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3538#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3537#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3536#L552-3 assume !(lis_~i~0 < lis_~N); 3535#L552-4 lis_~i~0 := 1; 3534#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3533#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3531#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3527#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3503#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3504#L555-3 assume !(lis_~j~0 < lis_~i~0); 3526#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3514#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3515#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3598#L556 assume !lis_#t~short11; 3597#L556-2 [2018-11-23 06:04:19,678 INFO L796 eck$LassoCheckResult]: Loop: 3597#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 3501#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3502#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3650#L556 assume !lis_#t~short11; 3589#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 3645#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3635#L555-3 assume !(lis_~j~0 < lis_~i~0); 3602#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3601#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3600#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3596#L556 assume !lis_#t~short11; 3597#L556-2 [2018-11-23 06:04:19,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1862607488, now seen corresponding path program 3 times [2018-11-23 06:04:19,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:19,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:19,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:19,707 INFO L82 PathProgramCache]: Analyzing trace with hash -599847033, now seen corresponding path program 1 times [2018-11-23 06:04:19,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:19,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:19,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:19,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:19,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:19,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash -135717720, now seen corresponding path program 5 times [2018-11-23 06:04:19,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:19,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:22,266 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 274 DAG size of output: 196 [2018-11-23 06:04:23,294 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 145 [2018-11-23 06:04:23,296 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:23,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:23,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:23,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:23,297 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:23,297 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:23,297 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:23,297 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:23,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration13_Lasso [2018-11-23 06:04:23,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:23,297 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:23,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:23,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:23,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:23,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:23,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:23,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:23,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,082 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2018-11-23 06:04:24,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,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-11-23 06:04:24,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-11-23 06:04:24,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:24,543 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:24,543 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:24,544 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-11-23 06:04:24,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:24,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:24,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:24,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,545 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-11-23 06:04:24,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:24,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:24,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:24,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,546 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-11-23 06:04:24,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,548 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-11-23 06:04:24,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,550 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-11-23 06:04:24,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:24,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:24,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:24,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,551 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-11-23 06:04:24,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,554 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-11-23 06:04:24,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,556 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-11-23 06:04:24,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,558 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-11-23 06:04:24,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,561 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-11-23 06:04:24,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,563 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-11-23 06:04:24,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:24,565 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-11-23 06:04:24,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:24,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:24,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:24,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:24,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:24,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:24,587 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:24,610 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 06:04:24,611 INFO L444 ModelExtractionUtils]: 46 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 06:04:24,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:24,611 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:04:24,612 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:24,612 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~a.base)_3, ULTIMATE.start_lis_~i~0) = 5*v_rep(select #length ULTIMATE.start_lis_~a.base)_3 - 32*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-23 06:04:24,832 INFO L297 tatePredicateManager]: 67 out of 68 supporting invariants were superfluous and have been removed [2018-11-23 06:04:24,833 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:04:24,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:24,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:24,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:24,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-23 06:04:24,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 218 transitions. cyclomatic complexity: 59 Second operand 10 states. [2018-11-23 06:04:25,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 218 transitions. cyclomatic complexity: 59. Second operand 10 states. Result 344 states and 466 transitions. Complement of second has 21 states. [2018-11-23 06:04:25,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states [2018-11-23 06:04:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 06:04:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2018-11-23 06:04:25,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 24 letters. Loop has 11 letters. [2018-11-23 06:04:25,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:25,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 35 letters. Loop has 11 letters. [2018-11-23 06:04:25,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:25,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 24 letters. Loop has 22 letters. [2018-11-23 06:04:25,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:25,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 466 transitions. [2018-11-23 06:04:25,104 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 55 [2018-11-23 06:04:25,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 297 states and 401 transitions. [2018-11-23 06:04:25,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-11-23 06:04:25,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2018-11-23 06:04:25,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 401 transitions. [2018-11-23 06:04:25,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:25,106 INFO L705 BuchiCegarLoop]: Abstraction has 297 states and 401 transitions. [2018-11-23 06:04:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 401 transitions. [2018-11-23 06:04:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 237. [2018-11-23 06:04:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-23 06:04:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 322 transitions. [2018-11-23 06:04:25,111 INFO L728 BuchiCegarLoop]: Abstraction has 237 states and 322 transitions. [2018-11-23 06:04:25,111 INFO L608 BuchiCegarLoop]: Abstraction has 237 states and 322 transitions. [2018-11-23 06:04:25,111 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 06:04:25,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 322 transitions. [2018-11-23 06:04:25,112 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48 [2018-11-23 06:04:25,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:25,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:25,113 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:25,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 06:04:25,113 INFO L794 eck$LassoCheckResult]: Stem: 4454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4449#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4445#L565 assume !(main_~array_size~0 < 1); 4446#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4455#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4469#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4470#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4467#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4468#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4474#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4475#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4472#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4471#L552-3 assume !(lis_~i~0 < lis_~N); 4473#L552-4 lis_~i~0 := 1; 4488#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4487#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4485#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4482#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4481#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4479#L555-3 assume !(lis_~j~0 < lis_~i~0); 4476#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4478#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4526#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4511#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4512#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 4542#L555-2 [2018-11-23 06:04:25,113 INFO L796 eck$LassoCheckResult]: Loop: 4542#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4541#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4539#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4536#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4534#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4535#L555-3 assume !(lis_~j~0 < lis_~i~0); 4530#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4531#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4552#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4549#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4544#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4542#L555-2 [2018-11-23 06:04:25,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1906257292, now seen corresponding path program 1 times [2018-11-23 06:04:25,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:25,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:25,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:26,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:26,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:26,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:26,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:26,136 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 06:04:26,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:04:26,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-23 06:04:26,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 06:04:26,188 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 12 treesize of output 11 [2018-11-23 06:04:26,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 06:04:26,200 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 12 treesize of output 11 [2018-11-23 06:04:26,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-23 06:04:26,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-23 06:04:26,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,258 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 20 treesize of output 31 [2018-11-23 06:04:26,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 06:04:26,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,271 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-23 06:04:26,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:48 [2018-11-23 06:04:26,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2018-11-23 06:04:26,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 06:04:26,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-11-23 06:04:26,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 94 [2018-11-23 06:04:26,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:26,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:66 [2018-11-23 06:04:26,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2018-11-23 06:04:26,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,638 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:26,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 142 [2018-11-23 06:04:26,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 94 [2018-11-23 06:04:26,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,676 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:26,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:26,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 143 [2018-11-23 06:04:26,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:26,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:26,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:86 [2018-11-23 06:04:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:26,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:26,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 33 [2018-11-23 06:04:26,892 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:26,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1272183771, now seen corresponding path program 7 times [2018-11-23 06:04:26,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:26,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:26,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:26,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:27,576 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2018-11-23 06:04:27,737 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-23 06:04:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 06:04:27,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 06:04:27,738 INFO L87 Difference]: Start difference. First operand 237 states and 322 transitions. cyclomatic complexity: 95 Second operand 34 states. [2018-11-23 06:04:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:30,888 INFO L93 Difference]: Finished difference Result 924 states and 1266 transitions. [2018-11-23 06:04:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 06:04:30,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 924 states and 1266 transitions. [2018-11-23 06:04:30,892 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 287 [2018-11-23 06:04:30,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 924 states to 924 states and 1266 transitions. [2018-11-23 06:04:30,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 663 [2018-11-23 06:04:30,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 663 [2018-11-23 06:04:30,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 924 states and 1266 transitions. [2018-11-23 06:04:30,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:30,897 INFO L705 BuchiCegarLoop]: Abstraction has 924 states and 1266 transitions. [2018-11-23 06:04:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states and 1266 transitions. [2018-11-23 06:04:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 267. [2018-11-23 06:04:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-23 06:04:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 363 transitions. [2018-11-23 06:04:30,906 INFO L728 BuchiCegarLoop]: Abstraction has 267 states and 363 transitions. [2018-11-23 06:04:30,906 INFO L608 BuchiCegarLoop]: Abstraction has 267 states and 363 transitions. [2018-11-23 06:04:30,906 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 06:04:30,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 267 states and 363 transitions. [2018-11-23 06:04:30,907 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 52 [2018-11-23 06:04:30,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:30,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:30,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:30,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 06:04:30,908 INFO L794 eck$LassoCheckResult]: Stem: 5800#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5795#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5791#L565 assume !(main_~array_size~0 < 1); 5792#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 5801#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5814#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5819#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5820#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5815#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5816#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5839#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5811#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5812#L552-3 assume !(lis_~i~0 < lis_~N); 5818#L552-4 lis_~i~0 := 1; 5838#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5837#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5834#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5835#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 5832#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5904#L555-3 assume !(lis_~j~0 < lis_~i~0); 5821#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5822#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5927#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5926#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5924#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 5925#L555-2 [2018-11-23 06:04:30,908 INFO L796 eck$LassoCheckResult]: Loop: 5925#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5932#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5907#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5909#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5908#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5906#L555-3 assume !(lis_~j~0 < lis_~i~0); 5905#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5899#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5895#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5888#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5889#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5925#L555-2 [2018-11-23 06:04:30,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1579363378, now seen corresponding path program 1 times [2018-11-23 06:04:30,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:30,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:30,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:30,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:30,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:31,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:31,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:31,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:31,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:31,617 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 06:04:31,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:04:31,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-23 06:04:31,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 06:04:31,644 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 12 treesize of output 11 [2018-11-23 06:04:31,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 06:04:31,653 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 12 treesize of output 11 [2018-11-23 06:04:31,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-23 06:04:31,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-23 06:04:31,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,717 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 18 treesize of output 27 [2018-11-23 06:04:31,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 06:04:31,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,733 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-23 06:04:31,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-11-23 06:04:31,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-23 06:04:31,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-23 06:04:31,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-11-23 06:04:31,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-11-23 06:04:31,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:79, output treesize:62 [2018-11-23 06:04:31,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-11-23 06:04:31,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-11-23 06:04:31,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-11-23 06:04:31,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:31,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 171 [2018-11-23 06:04:31,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:31,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:31,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:89 [2018-11-23 06:04:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:04:32,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:32,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2018-11-23 06:04:32,182 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:32,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1272183771, now seen corresponding path program 8 times [2018-11-23 06:04:32,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:32,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:32,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:32,856 WARN L180 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2018-11-23 06:04:32,975 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-23 06:04:32,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 06:04:32,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-11-23 06:04:32,976 INFO L87 Difference]: Start difference. First operand 267 states and 363 transitions. cyclomatic complexity: 108 Second operand 28 states. [2018-11-23 06:04:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:39,432 INFO L93 Difference]: Finished difference Result 475 states and 651 transitions. [2018-11-23 06:04:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 06:04:39,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 475 states and 651 transitions. [2018-11-23 06:04:39,434 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 133 [2018-11-23 06:04:39,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 475 states to 475 states and 651 transitions. [2018-11-23 06:04:39,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2018-11-23 06:04:39,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2018-11-23 06:04:39,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 651 transitions. [2018-11-23 06:04:39,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:39,436 INFO L705 BuchiCegarLoop]: Abstraction has 475 states and 651 transitions. [2018-11-23 06:04:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 651 transitions. [2018-11-23 06:04:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 248. [2018-11-23 06:04:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-23 06:04:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 335 transitions. [2018-11-23 06:04:39,441 INFO L728 BuchiCegarLoop]: Abstraction has 248 states and 335 transitions. [2018-11-23 06:04:39,441 INFO L608 BuchiCegarLoop]: Abstraction has 248 states and 335 transitions. [2018-11-23 06:04:39,441 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 06:04:39,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 335 transitions. [2018-11-23 06:04:39,442 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 52 [2018-11-23 06:04:39,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:39,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:39,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:39,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:04:39,443 INFO L794 eck$LassoCheckResult]: Stem: 6729#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6726#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6722#L565 assume !(main_~array_size~0 < 1); 6723#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 6730#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6742#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6746#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6747#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6743#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6744#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6766#L552-3 assume !(lis_~i~0 < lis_~N); 6709#L552-4 lis_~i~0 := 1; 6710#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6852#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6851#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6847#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6848#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6871#L555-3 assume !(lis_~j~0 < lis_~i~0); 6870#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6737#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6738#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6911#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6907#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 6909#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6952#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6887#L556 [2018-11-23 06:04:39,443 INFO L796 eck$LassoCheckResult]: Loop: 6887#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 6950#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6949#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6886#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6887#L556 [2018-11-23 06:04:39,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash -565876855, now seen corresponding path program 2 times [2018-11-23 06:04:39,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:39,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:39,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:39,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:39,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:40,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:40,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:40,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:04:40,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:04:40,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:04:40,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:40,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,053 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 17 treesize of output 29 [2018-11-23 06:04:40,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 06:04:40,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-23 06:04:40,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 06:04:40,100 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 12 treesize of output 11 [2018-11-23 06:04:40,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 06:04:40,107 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 12 treesize of output 11 [2018-11-23 06:04:40,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-23 06:04:40,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-23 06:04:40,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,160 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 20 treesize of output 31 [2018-11-23 06:04:40,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 06:04:40,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,175 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-23 06:04:40,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2018-11-23 06:04:40,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 93 [2018-11-23 06:04:40,399 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:40,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-11-23 06:04:40,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 74 [2018-11-23 06:04:40,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,431 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:40,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:40,433 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-23 06:04:40,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:40,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:40,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:67 [2018-11-23 06:04:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:40,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:40,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 34 [2018-11-23 06:04:40,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:40,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2222522, now seen corresponding path program 2 times [2018-11-23 06:04:40,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:40,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:40,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:40,717 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-11-23 06:04:40,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 06:04:40,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 06:04:40,815 INFO L87 Difference]: Start difference. First operand 248 states and 335 transitions. cyclomatic complexity: 99 Second operand 34 states. [2018-11-23 06:04:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:43,806 INFO L93 Difference]: Finished difference Result 314 states and 419 transitions. [2018-11-23 06:04:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 06:04:43,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 314 states and 419 transitions. [2018-11-23 06:04:43,808 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 70 [2018-11-23 06:04:43,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 314 states to 314 states and 419 transitions. [2018-11-23 06:04:43,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-23 06:04:43,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-23 06:04:43,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 419 transitions. [2018-11-23 06:04:43,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:43,810 INFO L705 BuchiCegarLoop]: Abstraction has 314 states and 419 transitions. [2018-11-23 06:04:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 419 transitions. [2018-11-23 06:04:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 253. [2018-11-23 06:04:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-23 06:04:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 339 transitions. [2018-11-23 06:04:43,814 INFO L728 BuchiCegarLoop]: Abstraction has 253 states and 339 transitions. [2018-11-23 06:04:43,814 INFO L608 BuchiCegarLoop]: Abstraction has 253 states and 339 transitions. [2018-11-23 06:04:43,814 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 06:04:43,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 253 states and 339 transitions. [2018-11-23 06:04:43,815 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 52 [2018-11-23 06:04:43,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:43,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:43,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:43,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:04:43,816 INFO L794 eck$LassoCheckResult]: Stem: 7485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7482#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7476#L565 assume !(main_~array_size~0 < 1); 7477#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7486#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7497#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7498#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7499#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7503#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7504#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7523#L552-3 assume !(lis_~i~0 < lis_~N); 7464#L552-4 lis_~i~0 := 1; 7465#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7605#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7604#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7600#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 7602#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7597#L555-3 assume !(lis_~j~0 < lis_~i~0); 7577#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7578#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7659#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7657#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7658#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 7660#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7639#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7638#L556 [2018-11-23 06:04:43,816 INFO L796 eck$LassoCheckResult]: Loop: 7638#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7611#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7607#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7608#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7638#L556 [2018-11-23 06:04:43,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -958903865, now seen corresponding path program 2 times [2018-11-23 06:04:43,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:43,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:43,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:44,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:44,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:44,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:04:44,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:04:44,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:04:44,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:44,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,268 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 17 treesize of output 29 [2018-11-23 06:04:44,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 06:04:44,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-23 06:04:44,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 06:04:44,303 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 12 treesize of output 11 [2018-11-23 06:04:44,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 06:04:44,311 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 12 treesize of output 11 [2018-11-23 06:04:44,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-23 06:04:44,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-23 06:04:44,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,361 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 18 treesize of output 27 [2018-11-23 06:04:44,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 06:04:44,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,375 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-23 06:04:44,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-23 06:04:44,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-23 06:04:44,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-23 06:04:44,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-11-23 06:04:44,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:44,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-11-23 06:04:44,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:44,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:44,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2018-11-23 06:04:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 06:04:44,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:44,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 30 [2018-11-23 06:04:44,610 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:44,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2222522, now seen corresponding path program 3 times [2018-11-23 06:04:44,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:44,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:44,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:44,749 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 06:04:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 06:04:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2018-11-23 06:04:44,842 INFO L87 Difference]: Start difference. First operand 253 states and 339 transitions. cyclomatic complexity: 98 Second operand 30 states. [2018-11-23 06:04:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:47,261 INFO L93 Difference]: Finished difference Result 352 states and 473 transitions. [2018-11-23 06:04:47,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 06:04:47,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 473 transitions. [2018-11-23 06:04:47,262 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 84 [2018-11-23 06:04:47,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 352 states and 473 transitions. [2018-11-23 06:04:47,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2018-11-23 06:04:47,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2018-11-23 06:04:47,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 473 transitions. [2018-11-23 06:04:47,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:47,263 INFO L705 BuchiCegarLoop]: Abstraction has 352 states and 473 transitions. [2018-11-23 06:04:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 473 transitions. [2018-11-23 06:04:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 243. [2018-11-23 06:04:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-23 06:04:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 327 transitions. [2018-11-23 06:04:47,266 INFO L728 BuchiCegarLoop]: Abstraction has 243 states and 327 transitions. [2018-11-23 06:04:47,266 INFO L608 BuchiCegarLoop]: Abstraction has 243 states and 327 transitions. [2018-11-23 06:04:47,266 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 06:04:47,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 327 transitions. [2018-11-23 06:04:47,267 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 52 [2018-11-23 06:04:47,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:47,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:47,267 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:47,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:04:47,267 INFO L794 eck$LassoCheckResult]: Stem: 8284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8280#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8275#L565 assume !(main_~array_size~0 < 1); 8276#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 8285#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8294#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8295#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8297#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8303#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8304#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8327#L552-3 assume !(lis_~i~0 < lis_~N); 8262#L552-4 lis_~i~0 := 1; 8263#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8409#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8408#L556 assume !lis_#t~short11; 8407#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 8403#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8404#L555-3 assume !(lis_~j~0 < lis_~i~0); 8400#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8292#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8293#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8459#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 8460#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 8278#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8437#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8436#L556 [2018-11-23 06:04:47,267 INFO L796 eck$LassoCheckResult]: Loop: 8436#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 8414#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8410#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8411#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8436#L556 [2018-11-23 06:04:47,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash -257839287, now seen corresponding path program 1 times [2018-11-23 06:04:47,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:47,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:47,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:04:47,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:47,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:47,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:47,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:47,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 06:04:47,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:04:47,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-23 06:04:47,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-23 06:04:47,720 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 12 treesize of output 11 [2018-11-23 06:04:47,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 06:04:47,734 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 12 treesize of output 11 [2018-11-23 06:04:47,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-23 06:04:47,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-23 06:04:47,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,777 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 18 treesize of output 27 [2018-11-23 06:04:47,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 06:04:47,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,790 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-23 06:04:47,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-11-23 06:04:47,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-23 06:04:47,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 06:04:47,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-11-23 06:04:47,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:47,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-11-23 06:04:47,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:47,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:47,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:55 [2018-11-23 06:04:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:04:48,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:48,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2018-11-23 06:04:48,136 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:48,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2222522, now seen corresponding path program 4 times [2018-11-23 06:04:48,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:48,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:48,321 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 06:04:48,469 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-23 06:04:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 06:04:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-11-23 06:04:48,470 INFO L87 Difference]: Start difference. First operand 243 states and 327 transitions. cyclomatic complexity: 96 Second operand 25 states. [2018-11-23 06:04:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:49,894 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2018-11-23 06:04:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 06:04:49,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 366 transitions. [2018-11-23 06:04:49,896 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 60 [2018-11-23 06:04:49,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 366 transitions. [2018-11-23 06:04:49,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2018-11-23 06:04:49,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2018-11-23 06:04:49,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 366 transitions. [2018-11-23 06:04:49,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:49,898 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 366 transitions. [2018-11-23 06:04:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 366 transitions. [2018-11-23 06:04:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 247. [2018-11-23 06:04:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-23 06:04:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 332 transitions. [2018-11-23 06:04:49,901 INFO L728 BuchiCegarLoop]: Abstraction has 247 states and 332 transitions. [2018-11-23 06:04:49,901 INFO L608 BuchiCegarLoop]: Abstraction has 247 states and 332 transitions. [2018-11-23 06:04:49,901 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 06:04:49,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 332 transitions. [2018-11-23 06:04:49,902 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 52 [2018-11-23 06:04:49,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:49,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:49,903 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:49,903 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:04:49,903 INFO L794 eck$LassoCheckResult]: Stem: 8945#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8941#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8936#L565 assume !(main_~array_size~0 < 1); 8937#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 8946#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8958#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8959#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8960#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8964#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8965#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8988#L552-3 assume !(lis_~i~0 < lis_~N); 8924#L552-4 lis_~i~0 := 1; 8925#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9068#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9067#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9064#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9065#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9060#L555-3 assume !(lis_~j~0 < lis_~i~0); 9061#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8954#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8955#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9119#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9120#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8942#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8943#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9168#L556 assume !lis_#t~short11; 8927#L556-2 [2018-11-23 06:04:49,903 INFO L796 eck$LassoCheckResult]: Loop: 8927#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 9101#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9099#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9097#L556 assume !lis_#t~short11; 8927#L556-2 [2018-11-23 06:04:49,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash -362372859, now seen corresponding path program 4 times [2018-11-23 06:04:49,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:49,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:49,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:49,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:49,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:49,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2464296, now seen corresponding path program 1 times [2018-11-23 06:04:49,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:49,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:49,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:49,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash 613161260, now seen corresponding path program 6 times [2018-11-23 06:04:49,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:49,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:49,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:49,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 06:04:49,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:49,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:50,008 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 06:04:50,038 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 06:04:50,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:04:50,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 06:04:50,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:50,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 06:04:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:04:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:04:50,147 INFO L87 Difference]: Start difference. First operand 247 states and 332 transitions. cyclomatic complexity: 97 Second operand 13 states. [2018-11-23 06:04:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:50,309 INFO L93 Difference]: Finished difference Result 296 states and 377 transitions. [2018-11-23 06:04:50,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 06:04:50,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 377 transitions. [2018-11-23 06:04:50,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2018-11-23 06:04:50,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 292 states and 373 transitions. [2018-11-23 06:04:50,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2018-11-23 06:04:50,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2018-11-23 06:04:50,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 373 transitions. [2018-11-23 06:04:50,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:50,314 INFO L705 BuchiCegarLoop]: Abstraction has 292 states and 373 transitions. [2018-11-23 06:04:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 373 transitions. [2018-11-23 06:04:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 205. [2018-11-23 06:04:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-23 06:04:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2018-11-23 06:04:50,317 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 272 transitions. [2018-11-23 06:04:50,317 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 272 transitions. [2018-11-23 06:04:50,317 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 06:04:50,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 272 transitions. [2018-11-23 06:04:50,318 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2018-11-23 06:04:50,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:50,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:50,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:04:50,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 06:04:50,319 INFO L794 eck$LassoCheckResult]: Stem: 9605#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9600#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 9594#L565 assume !(main_~array_size~0 < 1); 9595#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 9606#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9616#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9617#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9629#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9619#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9620#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9636#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9623#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9622#L552-3 assume !(lis_~i~0 < lis_~N); 9624#L552-4 lis_~i~0 := 1; 9635#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9634#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9632#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9631#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9630#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9628#L555-3 assume !(lis_~j~0 < lis_~i~0); 9625#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9627#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9698#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9699#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9722#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9721#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9719#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9716#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9707#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 9708#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9703#L555-3 assume !(lis_~j~0 < lis_~i~0); 9702#L554-2 [2018-11-23 06:04:50,319 INFO L796 eck$LassoCheckResult]: Loop: 9702#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9700#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9701#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9723#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9714#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9712#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9711#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 9709#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 9706#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 9704#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9705#L555-3 assume !(lis_~j~0 < lis_~i~0); 9702#L554-2 [2018-11-23 06:04:50,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash 209134494, now seen corresponding path program 3 times [2018-11-23 06:04:50,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:50,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:50,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:51,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:04:51,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:04:51,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:04:51,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:04:51,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:04:51,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:51,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,544 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 17 treesize of output 29 [2018-11-23 06:04:51,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 06:04:51,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2018-11-23 06:04:51,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2018-11-23 06:04:51,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,614 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 40 [2018-11-23 06:04:51,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-23 06:04:51,623 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 12 treesize of output 11 [2018-11-23 06:04:51,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:39 [2018-11-23 06:04:51,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 64 [2018-11-23 06:04:51,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,727 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:51,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,731 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:04:51,732 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 128 [2018-11-23 06:04:51,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-11-23 06:04:51,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,757 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 22 treesize of output 35 [2018-11-23 06:04:51,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 06:04:51,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:83 [2018-11-23 06:04:51,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-11-23 06:04:51,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-23 06:04:51,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-11-23 06:04:51,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 71 [2018-11-23 06:04:51,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-23 06:04:51,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:04:51,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 70 [2018-11-23 06:04:51,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 06:04:51,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:04:51,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:04:51,976 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:157, output treesize:32 [2018-11-23 06:04:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 06:04:52,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:04:52,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 34 [2018-11-23 06:04:52,068 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:52,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 370948975, now seen corresponding path program 9 times [2018-11-23 06:04:52,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:52,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:52,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:52,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:52,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:52,386 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-11-23 06:04:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 06:04:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 06:04:52,463 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. cyclomatic complexity: 75 Second operand 35 states. [2018-11-23 06:05:06,336 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2018-11-23 06:05:25,640 WARN L180 SmtUtils]: Spent 16.39 s on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-11-23 06:05:41,643 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2018-11-23 06:06:07,828 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-11-23 06:06:32,299 WARN L180 SmtUtils]: Spent 24.08 s on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2018-11-23 06:07:14,329 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2018-11-23 06:07:53,391 WARN L180 SmtUtils]: Spent 24.08 s on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2018-11-23 06:07:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:57,176 INFO L93 Difference]: Finished difference Result 794 states and 1050 transitions. [2018-11-23 06:07:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-23 06:07:57,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 794 states and 1050 transitions. [2018-11-23 06:07:57,179 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 251 [2018-11-23 06:07:57,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 794 states to 777 states and 1033 transitions. [2018-11-23 06:07:57,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 574 [2018-11-23 06:07:57,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 574 [2018-11-23 06:07:57,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 777 states and 1033 transitions. [2018-11-23 06:07:57,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:57,182 INFO L705 BuchiCegarLoop]: Abstraction has 777 states and 1033 transitions. [2018-11-23 06:07:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states and 1033 transitions. [2018-11-23 06:07:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 284. [2018-11-23 06:07:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 06:07:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 386 transitions. [2018-11-23 06:07:57,188 INFO L728 BuchiCegarLoop]: Abstraction has 284 states and 386 transitions. [2018-11-23 06:07:57,188 INFO L608 BuchiCegarLoop]: Abstraction has 284 states and 386 transitions. [2018-11-23 06:07:57,188 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 06:07:57,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 386 transitions. [2018-11-23 06:07:57,189 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 75 [2018-11-23 06:07:57,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:57,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:57,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:57,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 06:07:57,190 INFO L794 eck$LassoCheckResult]: Stem: 10901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10897#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 10891#L565 assume !(main_~array_size~0 < 1); 10892#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 10902#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10916#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10919#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10920#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10917#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10918#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10935#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10914#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10915#L552-3 assume !(lis_~i~0 < lis_~N); 10882#L552-4 lis_~i~0 := 1; 10883#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10938#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10936#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10927#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10928#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10923#L555-3 assume !(lis_~j~0 < lis_~i~0); 10924#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10940#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11023#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11014#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11015#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11142#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11141#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11140#L556 assume !lis_#t~short11; 11139#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 11138#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11068#L555-3 assume !(lis_~j~0 < lis_~i~0); 11069#L554-2 [2018-11-23 06:07:57,190 INFO L796 eck$LassoCheckResult]: Loop: 11069#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11064#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11065#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11117#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11115#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 10898#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10899#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11135#L556 assume !lis_#t~short11; 10885#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 11048#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11070#L555-3 assume !(lis_~j~0 < lis_~i~0); 11069#L554-2 [2018-11-23 06:07:57,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 209194076, now seen corresponding path program 7 times [2018-11-23 06:07:57,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:57,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:07:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2146017841, now seen corresponding path program 1 times [2018-11-23 06:07:57,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:57,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2007507210, now seen corresponding path program 8 times [2018-11-23 06:07:57,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:57,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 06:07:57,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:07:57,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:07:57,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:07:57,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:07:57,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:07:57,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:07:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 06:07:57,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:07:57,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-11-23 06:07:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 06:07:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-23 06:07:57,527 INFO L87 Difference]: Start difference. First operand 284 states and 386 transitions. cyclomatic complexity: 112 Second operand 17 states. [2018-11-23 06:07:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:57,713 INFO L93 Difference]: Finished difference Result 361 states and 477 transitions. [2018-11-23 06:07:57,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 06:07:57,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 477 transitions. [2018-11-23 06:07:57,715 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 124 [2018-11-23 06:07:57,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 309 states and 408 transitions. [2018-11-23 06:07:57,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 251 [2018-11-23 06:07:57,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2018-11-23 06:07:57,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 408 transitions. [2018-11-23 06:07:57,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:57,717 INFO L705 BuchiCegarLoop]: Abstraction has 309 states and 408 transitions. [2018-11-23 06:07:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 408 transitions. [2018-11-23 06:07:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 158. [2018-11-23 06:07:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 06:07:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 197 transitions. [2018-11-23 06:07:57,720 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 197 transitions. [2018-11-23 06:07:57,720 INFO L608 BuchiCegarLoop]: Abstraction has 158 states and 197 transitions. [2018-11-23 06:07:57,720 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 06:07:57,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 197 transitions. [2018-11-23 06:07:57,720 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2018-11-23 06:07:57,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:57,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:57,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:57,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2018-11-23 06:07:57,721 INFO L794 eck$LassoCheckResult]: Stem: 11705#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11703#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 11700#L565 assume !(main_~array_size~0 < 1); 11701#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 11706#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11715#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11716#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11717#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11721#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11722#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11719#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11712#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 11713#L552-3 assume !(lis_~i~0 < lis_~N); 11692#L552-4 lis_~i~0 := 1; 11693#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11750#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11747#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11748#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11768#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11767#L555-3 assume !(lis_~j~0 < lis_~i~0); 11765#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11764#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11763#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11761#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 11762#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 11843#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11842#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11793#L556 assume !lis_#t~short11; 11794#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 11772#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11815#L555-3 assume !(lis_~j~0 < lis_~i~0); 11813#L554-2 [2018-11-23 06:07:57,721 INFO L796 eck$LassoCheckResult]: Loop: 11813#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11838#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11711#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11829#L556 assume !lis_#t~short11; 11828#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 11827#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11826#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11824#L556 assume !lis_#t~short11; 11825#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 11845#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11844#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 11814#L556 assume !lis_#t~short11; 11840#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 11837#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11812#L555-3 assume !(lis_~j~0 < lis_~i~0); 11813#L554-2 [2018-11-23 06:07:57,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash 209194076, now seen corresponding path program 9 times [2018-11-23 06:07:57,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:57,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:07:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1620008424, now seen corresponding path program 2 times [2018-11-23 06:07:57,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:57,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:57,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:07:57,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash -631787475, now seen corresponding path program 10 times [2018-11-23 06:07:57,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:57,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:57,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:07:57,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:57,964 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2018-11-23 06:08:02,687 WARN L180 SmtUtils]: Spent 4.70 s on a formula simplification. DAG size of input: 337 DAG size of output: 231 [2018-11-23 06:08:04,106 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 156 [2018-11-23 06:08:04,108 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:08:04,108 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:08:04,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:08:04,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:08:04,108 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:08:04,108 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:04,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:08:04,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:08:04,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration22_Lasso [2018-11-23 06:08:04,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:08:04,109 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:08:04,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:04,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:06,309 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 115 [2018-11-23 06:08:06,466 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2018-11-23 06:08:06,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:06,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:06,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:06,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:06,787 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:08:06,787 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:08:06,787 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-11-23 06:08:06,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,789 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-11-23 06:08:06,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:06,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:08:06,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:08:06,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:06,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:08:06,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:08:06,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:06,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,795 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-11-23 06:08:06,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,796 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-11-23 06:08:06,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:06,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:06,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:06,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,801 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-11-23 06:08:06,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,802 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-11-23 06:08:06,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,803 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-11-23 06:08:06,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,805 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-11-23 06:08:06,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,806 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-11-23 06:08:06,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:06,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:08:06,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:08:06,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,809 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-11-23 06:08:06,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:08:06,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:08:06,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,811 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-11-23 06:08:06,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:06,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:06,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:06,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:06,812 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-11-23 06:08:06,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:06,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:06,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:06,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:06,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:08:06,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:08:06,816 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:08:06,817 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:08:06,817 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 06:08:06,818 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:08:06,818 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 06:08:06,818 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:08:06,818 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 8))_3, v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~prev~0.offset))_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 8))_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~prev~0.offset))_2 + 3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 12))_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0.base) (+ ULTIMATE.start_lis_~prev~0.offset 8))_3 - 3 >= 0] [2018-11-23 06:08:07,162 INFO L297 tatePredicateManager]: 79 out of 80 supporting invariants were superfluous and have been removed [2018-11-23 06:08:07,164 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:08:07,164 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:08:07,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:07,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:07,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 06:08:07,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:08:07,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-23 06:08:07,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 06:08:07,268 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 10 treesize of output 9 [2018-11-23 06:08:07,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 06:08:07,276 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 10 treesize of output 9 [2018-11-23 06:08:07,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-11-23 06:08:07,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2018-11-23 06:08:07,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 62 [2018-11-23 06:08:07,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:07,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-23 06:08:07,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,373 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 20 treesize of output 31 [2018-11-23 06:08:07,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 06:08:07,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,392 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-23 06:08:07,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:07,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:07,439 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:86, output treesize:99 [2018-11-23 06:08:07,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 77 [2018-11-23 06:08:07,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 175 [2018-11-23 06:08:07,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:07,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2018-11-23 06:08:07,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 94 [2018-11-23 06:08:07,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2018-11-23 06:08:07,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 78 [2018-11-23 06:08:07,676 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:07,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2018-11-23 06:08:07,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 79 [2018-11-23 06:08:07,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-23 06:08:07,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:07,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 90 [2018-11-23 06:08:07,808 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,820 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,832 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:07,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 06:08:07,866 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:197, output treesize:226 [2018-11-23 06:08:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:08,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:08:08,280 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 7 loop predicates [2018-11-23 06:08:08,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 197 transitions. cyclomatic complexity: 43 Second operand 18 states. [2018-11-23 06:08:08,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 197 transitions. cyclomatic complexity: 43. Second operand 18 states. Result 159 states and 198 transitions. Complement of second has 11 states. [2018-11-23 06:08:08,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 06:08:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 06:08:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-11-23 06:08:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-23 06:08:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:08,485 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:08:08,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:08,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:08,539 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 06:08:08,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:08:08,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-23 06:08:08,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 06:08:08,607 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 10 treesize of output 9 [2018-11-23 06:08:08,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 06:08:08,620 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 10 treesize of output 9 [2018-11-23 06:08:08,620 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-11-23 06:08:08,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2018-11-23 06:08:08,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 62 [2018-11-23 06:08:08,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:08,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-23 06:08:08,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,728 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 20 treesize of output 31 [2018-11-23 06:08:08,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 06:08:08,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,745 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-23 06:08:08,745 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,754 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:08,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:08,785 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:86, output treesize:99 [2018-11-23 06:08:08,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 77 [2018-11-23 06:08:08,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 175 [2018-11-23 06:08:08,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:08,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2018-11-23 06:08:08,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 94 [2018-11-23 06:08:08,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:08,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2018-11-23 06:08:08,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:08,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 78 [2018-11-23 06:08:08,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:09,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2018-11-23 06:08:09,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 79 [2018-11-23 06:08:09,099 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-23 06:08:09,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 90 [2018-11-23 06:08:09,125 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,137 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,146 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 06:08:09,180 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:197, output treesize:226 [2018-11-23 06:08:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:09,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:08:09,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 7 loop predicates [2018-11-23 06:08:09,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 197 transitions. cyclomatic complexity: 43 Second operand 18 states. [2018-11-23 06:08:09,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 197 transitions. cyclomatic complexity: 43. Second operand 18 states. Result 159 states and 198 transitions. Complement of second has 11 states. [2018-11-23 06:08:09,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 06:08:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 06:08:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-11-23 06:08:09,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-23 06:08:09,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:09,712 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:08:09,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:09,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:09,748 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 06:08:09,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:08:09,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-23 06:08:09,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 06:08:09,794 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 10 treesize of output 9 [2018-11-23 06:08:09,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 06:08:09,802 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 10 treesize of output 9 [2018-11-23 06:08:09,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-11-23 06:08:09,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2018-11-23 06:08:09,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 62 [2018-11-23 06:08:09,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:09,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-23 06:08:09,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,877 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 20 treesize of output 31 [2018-11-23 06:08:09,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 06:08:09,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:09,891 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-23 06:08:09,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:09,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:09,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:09,926 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:86, output treesize:99 [2018-11-23 06:08:10,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2018-11-23 06:08:10,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 79 [2018-11-23 06:08:10,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-11-23 06:08:10,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 90 [2018-11-23 06:08:10,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 77 [2018-11-23 06:08:10,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 175 [2018-11-23 06:08:10,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:10,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2018-11-23 06:08:10,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 78 [2018-11-23 06:08:10,239 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,250 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2018-11-23 06:08:10,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:10,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 94 [2018-11-23 06:08:10,261 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,274 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:10,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:10,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 06:08:10,328 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:197, output treesize:226 [2018-11-23 06:08:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:10,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:08:10,681 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 7 loop predicates [2018-11-23 06:08:10,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 197 transitions. cyclomatic complexity: 43 Second operand 18 states. [2018-11-23 06:08:11,166 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-11-23 06:08:12,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 197 transitions. cyclomatic complexity: 43. Second operand 18 states. Result 457 states and 595 transitions. Complement of second has 59 states. [2018-11-23 06:08:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 26 states 18 stem states 6 non-accepting loop states 2 accepting loop states [2018-11-23 06:08:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 06:08:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 247 transitions. [2018-11-23 06:08:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 247 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-23 06:08:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 247 transitions. Stem has 46 letters. Loop has 15 letters. [2018-11-23 06:08:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 247 transitions. Stem has 31 letters. Loop has 30 letters. [2018-11-23 06:08:12,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:12,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 595 transitions. [2018-11-23 06:08:12,169 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 163 [2018-11-23 06:08:12,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 435 states and 567 transitions. [2018-11-23 06:08:12,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2018-11-23 06:08:12,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 384 [2018-11-23 06:08:12,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 435 states and 567 transitions. [2018-11-23 06:08:12,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:08:12,172 INFO L705 BuchiCegarLoop]: Abstraction has 435 states and 567 transitions. [2018-11-23 06:08:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states and 567 transitions. [2018-11-23 06:08:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 205. [2018-11-23 06:08:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-23 06:08:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2018-11-23 06:08:12,175 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 259 transitions. [2018-11-23 06:08:12,175 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 259 transitions. [2018-11-23 06:08:12,175 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 06:08:12,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 259 transitions. [2018-11-23 06:08:12,179 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2018-11-23 06:08:12,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:08:12,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:08:12,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:08:12,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 06:08:12,180 INFO L794 eck$LassoCheckResult]: Stem: 13582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13577#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 13573#L565 assume !(main_~array_size~0 < 1); 13574#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 13583#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13597#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13607#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13608#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13598#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13595#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13596#L552-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13603#L552-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13602#L552-3 assume !(lis_~i~0 < lis_~N); 13604#L552-4 lis_~i~0 := 1; 13639#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13638#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13636#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13635#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13634#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13633#L555-3 assume !(lis_~j~0 < lis_~i~0); 13631#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 13632#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13716#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13712#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13713#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13708#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13709#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13704#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13705#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13764#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13762#L555-3 assume !(lis_~j~0 < lis_~i~0); 13761#L554-2 [2018-11-23 06:08:12,180 INFO L796 eck$LassoCheckResult]: Loop: 13761#L554-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 13760#L554-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13759#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13757#L556 assume !lis_#t~short11; 13756#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 13755#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13754#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13752#L556 assume !lis_#t~short11; 13753#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10; 13747#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13748#L555-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13721#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13722#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8;havoc lis_#t~mem9;havoc lis_#t~mem10;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13701#L555-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13763#L555-3 assume !(lis_~j~0 < lis_~i~0); 13761#L554-2 [2018-11-23 06:08:12,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:12,181 INFO L82 PathProgramCache]: Analyzing trace with hash 209132572, now seen corresponding path program 3 times [2018-11-23 06:08:12,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:08:12,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:08:12,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:12,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:08:12,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:08:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:08:12,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1619946920, now seen corresponding path program 3 times [2018-11-23 06:08:12,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:08:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:08:12,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:12,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:08:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:08:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:08:12,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:12,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1243727827, now seen corresponding path program 11 times [2018-11-23 06:08:12,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:08:12,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:08:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:12,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:08:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 18 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:08:13,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:08:13,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_443f6416-c9f1-4d62-926f-f5aea42c4788/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:08:13,230 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 06:08:13,531 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 06:08:13,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:08:13,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:13,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,542 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 17 treesize of output 29 [2018-11-23 06:08:13,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 06:08:13,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:13,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:13,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:13,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-11-23 06:08:13,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-23 06:08:13,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,613 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 43 [2018-11-23 06:08:13,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:13,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 24 [2018-11-23 06:08:13,622 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 12 treesize of output 11 [2018-11-23 06:08:13,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:13,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:13,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-23 06:08:13,631 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 12 treesize of output 11 [2018-11-23 06:08:13,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:13,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:13,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:13,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:13,656 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:81, output treesize:99 [2018-11-23 06:08:13,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 110 [2018-11-23 06:08:13,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:13,962 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 171 [2018-11-23 06:08:13,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-11-23 06:08:14,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 88 [2018-11-23 06:08:14,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,048 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 53 treesize of output 71 [2018-11-23 06:08:14,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-23 06:08:14,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 82 [2018-11-23 06:08:14,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,074 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2018-11-23 06:08:14,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,082 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 84 [2018-11-23 06:08:14,082 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,098 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 98 [2018-11-23 06:08:14,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,105 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2018-11-23 06:08:14,106 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,116 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 06:08:14,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 87 [2018-11-23 06:08:14,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,328 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 43 [2018-11-23 06:08:14,328 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 06:08:14,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-11-23 06:08:14,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,352 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 39 treesize of output 55 [2018-11-23 06:08:14,352 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,359 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 50 [2018-11-23 06:08:14,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:14,366 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 68 [2018-11-23 06:08:14,367 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,374 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:08:14,393 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 06:08:14,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-23 06:08:14,502 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:250, output treesize:550 [2018-11-23 06:08:14,834 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 06:08:15,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 161 [2018-11-23 06:08:15,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,112 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:08:15,112 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:08:15,114 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:08:15,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 229 [2018-11-23 06:08:15,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:08:15,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 139 [2018-11-23 06:08:15,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:08:15,195 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 109 [2018-11-23 06:08:15,197 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 06:08:15,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 06:08:15,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 06:08:15,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 3 xjuncts. [2018-11-23 06:08:15,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:169, output treesize:417 [2018-11-23 06:08:44,320 WARN L180 SmtUtils]: Spent 28.90 s on a formula simplification. DAG size of input: 140 DAG size of output: 97 [2018-11-23 06:08:49,891 WARN L180 SmtUtils]: Spent 5.49 s on a formula simplification that was a NOOP. DAG size: 99 [2018-11-23 06:08:52,028 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 99 [2018-11-23 06:09:17,889 WARN L180 SmtUtils]: Spent 23.97 s on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2018-11-23 06:09:29,609 WARN L180 SmtUtils]: Spent 11.60 s on a formula simplification that was a NOOP. DAG size: 107 [2018-11-23 06:09:36,131 WARN L180 SmtUtils]: Spent 6.42 s on a formula simplification that was a NOOP. DAG size: 107 [2018-11-23 06:09:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 06:09:36,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:09:36,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2018-11-23 06:09:36,461 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2018-11-23 06:09:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 06:09:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 06:09:36,510 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. cyclomatic complexity: 59 Second operand 40 states. [2018-11-23 06:09:38,576 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 78 [2018-11-23 06:09:39,634 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 156 [2018-11-23 06:09:40,315 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 153 [2018-11-23 06:09:44,140 WARN L180 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 165 DAG size of output: 136 [2018-11-23 06:09:49,578 WARN L180 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2018-11-23 06:09:49,835 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-11-23 06:09:50,468 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2018-11-23 06:09:53,567 WARN L180 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2018-11-23 06:09:53,802 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 136 [2018-11-23 06:09:57,964 WARN L180 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2018-11-23 06:10:09,215 WARN L180 SmtUtils]: Spent 11.17 s on a formula simplification. DAG size of input: 155 DAG size of output: 141 [2018-11-23 06:10:13,651 WARN L180 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2018-11-23 06:10:26,051 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2018-11-23 06:10:32,457 WARN L180 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 128 DAG size of output: 117 [2018-11-23 06:10:33,523 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-23 06:10:33,523 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:65) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 38 more [2018-11-23 06:10:33,526 INFO L168 Benchmark]: Toolchain (without parser) took 394057.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.0 MB). Free memory was 957.6 MB in the beginning and 915.2 MB in the end (delta: 42.4 MB). Peak memory consumption was 517.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:33,526 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:10:33,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:33,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:33,527 INFO L168 Benchmark]: Boogie Preprocessor took 20.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:10:33,527 INFO L168 Benchmark]: RCFGBuilder took 224.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:33,527 INFO L168 Benchmark]: BuchiAutomizer took 393414.21 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 192.2 MB). Peak memory consumption was 512.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:33,528 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 224.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 393414.21 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 192.2 MB). Peak memory consumption was 512.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...