./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/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 32bit --witnessprinter.graph.data.programhash b03f52438c8a4febc4c57e40202386008cb3a895 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:19:51,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:19:51,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:19:51,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:19:51,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:19:51,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:19:51,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:19:51,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:19:51,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:19:51,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:19:51,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:19:51,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:19:51,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:19:51,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:19:51,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:19:51,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:19:51,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:19:51,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:19:51,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:19:51,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:19:51,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:19:51,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:19:51,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:19:51,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:19:51,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:19:51,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:19:51,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:19:51,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:19:51,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:19:51,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:19:51,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:19:51,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:19:51,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:19:51,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:19:51,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:19:51,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:19:51,268 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:19:51,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:19:51,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:19:51,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:19:51,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:19:51,280 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:19:51,280 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:19:51,280 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:19:51,280 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:19:51,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:19:51,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:19:51,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:19:51,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:19:51,283 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:19:51,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:19:51,283 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:19:51,283 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:19:51,283 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:19:51,283 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_56665d38-dca9-4c85-905b-88d7e7d5d3da/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b03f52438c8a4febc4c57e40202386008cb3a895 [2018-11-18 16:19:51,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:19:51,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:19:51,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:19:51,318 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:19:51,318 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:19:51,318 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-11-18 16:19:51,356 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/data/1fed41536/bba92846222a47adb93e81feba351a15/FLAG4b104081a [2018-11-18 16:19:51,752 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:19:51,753 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-11-18 16:19:51,757 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/data/1fed41536/bba92846222a47adb93e81feba351a15/FLAG4b104081a [2018-11-18 16:19:51,769 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/bin-2019/uautomizer/data/1fed41536/bba92846222a47adb93e81feba351a15 [2018-11-18 16:19:51,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:19:51,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:19:51,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:19:51,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:19:51,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:19:51,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a19fc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51, skipping insertion in model container [2018-11-18 16:19:51,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:19:51,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:19:51,894 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:19:51,896 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:19:51,907 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:19:51,918 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:19:51,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51 WrapperNode [2018-11-18 16:19:51,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:19:51,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:19:51,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:19:51,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:19:51,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:19:51,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:19:51,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:19:51,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:19:51,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:51,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:52,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... [2018-11-18 16:19:52,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:19:52,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:19:52,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:19:52,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:19:52,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56665d38-dca9-4c85-905b-88d7e7d5d3da/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-18 16:19:52,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:19:52,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:19:52,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:19:52,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:19:52,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:19:52,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:19:52,154 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:19:52,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:52 BoogieIcfgContainer [2018-11-18 16:19:52,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:19:52,155 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:19:52,155 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:19:52,158 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:19:52,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:19:52,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:19:51" (1/3) ... [2018-11-18 16:19:52,160 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e11badb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:19:52, skipping insertion in model container [2018-11-18 16:19:52,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:19:52,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:19:51" (2/3) ... [2018-11-18 16:19:52,161 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e11badb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:19:52, skipping insertion in model container [2018-11-18 16:19:52,161 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:19:52,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:52" (3/3) ... [2018-11-18 16:19:52,164 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_shadowinit_true-unreach-call_true-termination.i [2018-11-18 16:19:52,213 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:19:52,214 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:19:52,214 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:19:52,214 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:19:52,214 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:19:52,215 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:19:52,215 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:19:52,215 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:19:52,215 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:19:52,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:19:52,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 16:19:52,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:19:52,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:19:52,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 16:19:52,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 16:19:52,255 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:19:52,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:19:52,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 16:19:52,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:19:52,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:19:52,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 16:19:52,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 16:19:52,265 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem1, main_~i~0, main_~k~0, main_~#a~0.base, main_~#a~0.offset;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; 6#L7true assume ~N~0 > 0;havoc main_~i~0;havoc main_~k~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~N~0);main_~i~0 := 0;main_~k~0 := 0; 8#L12-3true [2018-11-18 16:19:52,265 INFO L796 eck$LassoCheckResult]: Loop: 8#L12-3true assume true; 12#L12-1true assume !!(main_~i~0 < ~N~0);call write~int(main_~k~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~k~0, 4);main_~i~0 := 1 + main_~i~0;main_~k~0 := 1 + main_~k~0; 8#L12-3true [2018-11-18 16:19:52,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-18 16:19:52,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:52,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:52,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:52,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:52,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1255, now seen corresponding path program 1 times [2018-11-18 16:19:52,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:52,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:52,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:52,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash 28693832, now seen corresponding path program 1 times [2018-11-18 16:19:52,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:52,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:52,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:52,563 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:19:52,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:19:52,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:19:52,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:19:52,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:19:52,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:19:52,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:19:52,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:19:52,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 16:19:52,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:19:52,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:19:52,587 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-18 16:19:52,592 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-18 16:19:52,595 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-18 16:19:52,598 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-18 16:19:52,601 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-18 16:19:52,639 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-18 16:19:52,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:19:52,772 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:19:52,774 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-18 16:19:52,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:19:52,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:19:52,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:19:52,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,782 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-18 16:19:52,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:19:52,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:19:52,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:19:52,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:19:52,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:19:52,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:19:52,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:19:52,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,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-18 16:19:52,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:19:52,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:19:52,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,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-18 16:19:52,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:19:52,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:19:52,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,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-18 16:19:52,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:19:52,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:19:52,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,813 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-18 16:19:52,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,813 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:19:52,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,815 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:19:52,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:19:52,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,821 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-18 16:19:52,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:19:52,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:19:52,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:19:52,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:52,823 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-18 16:19:52,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:52,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:52,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:52,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:52,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:19:52,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:19:52,865 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:19:52,890 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:19:52,891 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 16:19:52,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:19:52,894 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:19:52,894 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:19:52,895 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1, ULTIMATE.start_main_~#a~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 - 1*ULTIMATE.start_main_~#a~0.offset Supporting invariants [] [2018-11-18 16:19:52,898 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 16:19:52,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:19:52,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:52,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:52,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:52,960 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-18 16:19:52,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-18 16:19:52,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2018-11-18 16:19:53,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 40 states and 49 transitions. Complement of second has 6 states. [2018-11-18 16:19:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 16:19:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 16:19:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-18 16:19:53,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-18 16:19:53,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:19:53,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-18 16:19:53,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:19:53,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 16:19:53,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:19:53,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2018-11-18 16:19:53,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:19:53,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 12 states and 14 transitions. [2018-11-18 16:19:53,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 16:19:53,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 16:19:53,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2018-11-18 16:19:53,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:19:53,013 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 16:19:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2018-11-18 16:19:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 16:19:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 16:19:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-18 16:19:53,035 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 16:19:53,035 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 16:19:53,035 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:19:53,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-18 16:19:53,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:19:53,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:19:53,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:19:53,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:19:53,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:19:53,037 INFO L794 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 99#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem1, main_~i~0, main_~k~0, main_~#a~0.base, main_~#a~0.offset;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; 100#L7 assume ~N~0 > 0;havoc main_~i~0;havoc main_~k~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~N~0);main_~i~0 := 0;main_~k~0 := 0; 110#L12-3 assume true; 105#L12-1 assume !(main_~i~0 < ~N~0); 106#L12-4 main_~i~0 := 0; 101#L18-3 [2018-11-18 16:19:53,037 INFO L796 eck$LassoCheckResult]: Loop: 101#L18-3 assume true; 102#L18-1 assume !!(main_~i~0 < ~N~0);call main_#t~mem1 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem1 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 109#L2 assume !(0 == __VERIFIER_assert_~cond); 103#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem1;main_~i~0 := 1 + main_~i~0; 101#L18-3 [2018-11-18 16:19:53,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash 889508749, now seen corresponding path program 1 times [2018-11-18 16:19:53,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:53,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:53,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:53,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:53,065 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-18 16:19:53,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:19:53,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:19:53,068 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:19:53,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1637737, now seen corresponding path program 1 times [2018-11-18 16:19:53,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:53,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:19:53,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:19:53,153 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-18 16:19:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:19:53,174 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-18 16:19:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:19:53,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-11-18 16:19:53,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:19:53,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 14 transitions. [2018-11-18 16:19:53,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 16:19:53,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 16:19:53,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-18 16:19:53,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:19:53,176 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-18 16:19:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-18 16:19:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-18 16:19:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 16:19:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 16:19:53,178 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 16:19:53,178 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 16:19:53,178 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:19:53,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-18 16:19:53,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:19:53,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:19:53,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:19:53,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 16:19:53,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:19:53,179 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem1, main_~i~0, main_~k~0, main_~#a~0.base, main_~#a~0.offset;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; 134#L7 assume ~N~0 > 0;havoc main_~i~0;havoc main_~k~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~N~0);main_~i~0 := 0;main_~k~0 := 0; 142#L12-3 assume true; 139#L12-1 assume !!(main_~i~0 < ~N~0);call write~int(main_~k~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~k~0, 4);main_~i~0 := 1 + main_~i~0;main_~k~0 := 1 + main_~k~0; 140#L12-3 assume true; 137#L12-1 assume !(main_~i~0 < ~N~0); 138#L12-4 main_~i~0 := 0; 132#L18-3 [2018-11-18 16:19:53,180 INFO L796 eck$LassoCheckResult]: Loop: 132#L18-3 assume true; 135#L18-1 assume !!(main_~i~0 < ~N~0);call main_#t~mem1 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem1 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 141#L2 assume !(0 == __VERIFIER_assert_~cond); 131#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem1;main_~i~0 := 1 + main_~i~0; 132#L18-3 [2018-11-18 16:19:53,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash 119466279, now seen corresponding path program 1 times [2018-11-18 16:19:53,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:53,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:53,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1637737, now seen corresponding path program 2 times [2018-11-18 16:19:53,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:19:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash 498262927, now seen corresponding path program 1 times [2018-11-18 16:19:53,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:19:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:19:53,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:19:53,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:19:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:19:53,395 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:19:53,395 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:19:53,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:19:53,395 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:19:53,395 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:19:53,395 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:19:53,395 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:19:53,395 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:19:53,395 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-18 16:19:53,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:19:53,396 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:19:53,398 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-18 16:19:53,405 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-18 16:19:53,406 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-18 16:19:53,411 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-18 16:19:53,456 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-18 16:19:53,458 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-18 16:19:53,459 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-18 16:19:53,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:19:53,558 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:19:53,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-18 16:19:53,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:53,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:19:53,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:53,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:53,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:53,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:19:53,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:19:53,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:53,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-18 16:19:53,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:53,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:19:53,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:53,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:53,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:53,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:19:53,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:19:53,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:53,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-18 16:19:53,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:53,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:19:53,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:53,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:53,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:53,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:19:53,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:19:53,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:19:53,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-18 16:19:53,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:19:53,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:19:53,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:19:53,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:19:53,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:19:53,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:19:53,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:19:53,591 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:19:53,591 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:19:53,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:19:53,592 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:19:53,592 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:19:53,593 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ~N~0) = -1*ULTIMATE.start_main_~i~0 + 1*~N~0 Supporting invariants [] [2018-11-18 16:19:53,599 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 16:19:53,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:19:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:53,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:19:53,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:19:53,632 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-18 16:19:53,632 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-18 16:19:53,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 16:19:53,647 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 18 transitions. Complement of second has 6 states. [2018-11-18 16:19:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:19:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:19:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 16:19:53,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-18 16:19:53,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:19:53,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-18 16:19:53,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:19:53,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-18 16:19:53,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:19:53,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2018-11-18 16:19:53,650 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:19:53,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-18 16:19:53,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:19:53,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:19:53,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:19:53,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:19:53,650 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:19:53,650 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:19:53,651 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:19:53,654 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:19:53,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:19:53,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:19:53,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:19:53,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:19:53 BoogieIcfgContainer [2018-11-18 16:19:53,658 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:19:53,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:19:53,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:19:53,659 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:19:53,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:19:52" (3/4) ... [2018-11-18 16:19:53,662 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:19:53,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:19:53,663 INFO L168 Benchmark]: Toolchain (without parser) took 1891.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 959.2 MB in the beginning and 911.5 MB in the end (delta: 47.8 MB). Peak memory consumption was 196.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:53,664 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:19:53,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:53,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.22 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:53,665 INFO L168 Benchmark]: Boogie Preprocessor took 53.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:53,666 INFO L168 Benchmark]: RCFGBuilder took 152.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:53,667 INFO L168 Benchmark]: BuchiAutomizer took 1503.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 210.3 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:19:53,668 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.2 GB. Free memory is still 911.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:19:53,672 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.22 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 152.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1503.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 210.3 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.2 GB. Free memory is still 911.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[a] + -1 * a and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 25 SDslu, 14 SDs, 0 SdLazy, 17 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax100 hnf100 lsp92 ukn69 mio100 lsp81 div100 bol100 ite100 ukn100 eq161 hnf90 smp97 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...