./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 276936ba1494f32a328b3de86f664a380d5263e9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:11,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:11,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:11,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:11,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:11,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:11,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:11,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:11,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:11,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:11,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:11,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:11,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:11,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:11,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:11,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:11,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:11,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:11,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:11,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:11,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:11,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:11,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:11,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:11,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:11,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:11,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:11,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:11,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:11,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:11,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:11,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:11,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:11,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:11,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:11,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:11,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:11,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:11,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:11,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:11,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:11,921 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:11,936 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:11,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:11,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:11,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:11,937 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:11,937 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:11,938 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:11,938 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:11,938 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:11,938 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:11,938 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:11,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:11,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:11,939 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:11,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:11,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:11,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:11,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:11,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:11,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:11,943 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:11,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:11,943 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:11,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:11,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:11,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:11,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:11,944 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:11,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:11,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:11,945 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:11,946 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:11,946 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 276936ba1494f32a328b3de86f664a380d5263e9 [2019-10-22 08:57:11,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:12,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:12,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:12,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:12,013 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:12,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i [2019-10-22 08:57:12,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/data/81a99ab65/c689e6c9287140338cfd439780c7a4d9/FLAGa9ab2f4a1 [2019-10-22 08:57:12,504 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:12,505 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i [2019-10-22 08:57:12,518 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/data/81a99ab65/c689e6c9287140338cfd439780c7a4d9/FLAGa9ab2f4a1 [2019-10-22 08:57:12,848 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/data/81a99ab65/c689e6c9287140338cfd439780c7a4d9 [2019-10-22 08:57:12,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:12,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:12,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:12,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:12,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:12,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:12" (1/1) ... [2019-10-22 08:57:12,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d01eb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:12, skipping insertion in model container [2019-10-22 08:57:12,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:12" (1/1) ... [2019-10-22 08:57:12,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:12,911 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:13,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:13,300 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:13,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:13,381 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:13,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13 WrapperNode [2019-10-22 08:57:13,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:13,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:13,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:13,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:13,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:13,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:13,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:13,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:13,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... [2019-10-22 08:57:13,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:13,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:13,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:13,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:13,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95f677ee-f11e-44a9-9d48-05f87640af71/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:13,897 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:13,897 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:13,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:13 BoogieIcfgContainer [2019-10-22 08:57:13,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:13,899 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:13,899 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:13,902 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:13,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:13,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:12" (1/3) ... [2019-10-22 08:57:13,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2d26b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:13, skipping insertion in model container [2019-10-22 08:57:13,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:13,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:13" (2/3) ... [2019-10-22 08:57:13,905 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2d26b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:13, skipping insertion in model container [2019-10-22 08:57:13,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:13,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:13" (3/3) ... [2019-10-22 08:57:13,907 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrchr-alloca-2.i [2019-10-22 08:57:13,951 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:13,952 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:13,952 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:13,952 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:13,952 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:13,952 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:13,952 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:13,952 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:13,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:57:13,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:57:13,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:13,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:13,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:13,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:13,990 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:13,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:57:13,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:57:13,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:13,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:13,992 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:13,992 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:14,000 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet12, main_#t~ret13.base, main_#t~ret13.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8; 11#L522true assume !(main_~length~0 < 1); 16#L522-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 7#L527-3true [2019-10-22 08:57:14,000 INFO L793 eck$LassoCheckResult]: Loop: 7#L527-3true assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet11, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 6#L527-2true main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 7#L527-3true [2019-10-22 08:57:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:57:14,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:14,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506844224] [2019-10-22 08:57:14,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:14,119 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 08:57:14,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:14,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194292106] [2019-10-22 08:57:14,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:14,139 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:14,141 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 08:57:14,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:14,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277809446] [2019-10-22 08:57:14,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:14,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:14,173 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:14,314 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:14,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:14,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:14,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:14,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:14,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:14,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:14,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:14,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrchr-alloca-2.i_Iteration1_Lasso [2019-10-22 08:57:14,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:14,317 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:14,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:14,726 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:14,731 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:14,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:14,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,741 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:14,742 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:14,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:14,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,757 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:14,757 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:14,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:14,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:14,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:14,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:14,769 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:14,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:14,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:14,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,797 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:14,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,798 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:14,798 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:14,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:14,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:14,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:14,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:14,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:14,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:14,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,815 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,819 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:14,823 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:14,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,835 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:14,835 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:14,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,847 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:14,847 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:14,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,860 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:14,867 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:14,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:14,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,886 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:14,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:14,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:14,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:14,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:14,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:14,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:14,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:14,895 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:14,895 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:14,954 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:14,979 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:14,980 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:14,985 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:14,986 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:14,986 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:14,987 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 08:57:14,998 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:57:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:15,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:15,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:15,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:15,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:15,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:15,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-10-22 08:57:15,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 57 transitions. Complement of second has 7 states. [2019-10-22 08:57:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-10-22 08:57:15,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:57:15,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:15,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:57:15,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:15,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:57:15,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:15,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 57 transitions. [2019-10-22 08:57:15,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:15,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 11 states and 15 transitions. [2019-10-22 08:57:15,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:57:15,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:57:15,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-10-22 08:57:15,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:15,187 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:57:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-10-22 08:57:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:57:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:57:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-10-22 08:57:15,213 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:57:15,213 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:57:15,213 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:15,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-10-22 08:57:15,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:15,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:15,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:15,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:15,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:15,215 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet12, main_#t~ret13.base, main_#t~ret13.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8; 116#L522 assume !(main_~length~0 < 1); 120#L522-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 121#L527-3 assume !(main_~i~0 < main_~length~0 - 1); 124#L527-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet12;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset, cstrchr_#t~mem2, cstrchr_#t~mem3, cstrchr_#t~short4, cstrchr_#t~mem6, cstrchr_#t~ite7.base, cstrchr_#t~ite7.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 125#L516-5 [2019-10-22 08:57:15,215 INFO L793 eck$LassoCheckResult]: Loop: 125#L516-5 call cstrchr_#t~mem2 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1);cstrchr_#t~short4 := 0 != cstrchr_#t~mem2; 117#L516-1 assume !cstrchr_#t~short4; 118#L516-3 assume !!cstrchr_#t~short4;havoc cstrchr_#t~short4;havoc cstrchr_#t~mem2;havoc cstrchr_#t~mem3;cstrchr_#t~post5.base, cstrchr_#t~post5.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post5.base, 1 + cstrchr_#t~post5.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset; 125#L516-5 [2019-10-22 08:57:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,215 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 08:57:15,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601765816] [2019-10-22 08:57:15,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,245 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,245 INFO L82 PathProgramCache]: Analyzing trace with hash 57761, now seen corresponding path program 1 times [2019-10-22 08:57:15,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900243445] [2019-10-22 08:57:15,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:15,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900243445] [2019-10-22 08:57:15,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:15,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:15,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888829506] [2019-10-22 08:57:15,301 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:15,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:15,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:15,305 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:57:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:15,315 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-10-22 08:57:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:15,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-10-22 08:57:15,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:15,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 14 transitions. [2019-10-22 08:57:15,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:57:15,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:57:15,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:57:15,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:15,318 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:57:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:57:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:57:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:57:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-10-22 08:57:15,320 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:57:15,320 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:57:15,320 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:15,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-10-22 08:57:15,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:15,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:15,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:15,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:15,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:15,322 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet12, main_#t~ret13.base, main_#t~ret13.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8; 145#L522 assume !(main_~length~0 < 1); 149#L522-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 150#L527-3 assume !(main_~i~0 < main_~length~0 - 1); 153#L527-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet12;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset, cstrchr_#t~mem2, cstrchr_#t~mem3, cstrchr_#t~short4, cstrchr_#t~mem6, cstrchr_#t~ite7.base, cstrchr_#t~ite7.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 154#L516-5 [2019-10-22 08:57:15,322 INFO L793 eck$LassoCheckResult]: Loop: 154#L516-5 call cstrchr_#t~mem2 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1);cstrchr_#t~short4 := 0 != cstrchr_#t~mem2; 147#L516-1 assume cstrchr_#t~short4;call cstrchr_#t~mem3 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1);cstrchr_#t~short4 := cstrchr_#t~mem3 != (if cstrchr_~c % 256 <= 127 then cstrchr_~c % 256 else cstrchr_~c % 256 - 256); 148#L516-3 assume !!cstrchr_#t~short4;havoc cstrchr_#t~short4;havoc cstrchr_#t~mem2;havoc cstrchr_#t~mem3;cstrchr_#t~post5.base, cstrchr_#t~post5.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post5.base, 1 + cstrchr_#t~post5.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset; 154#L516-5 [2019-10-22 08:57:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-10-22 08:57:15,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273446370] [2019-10-22 08:57:15,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,343 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash 57699, now seen corresponding path program 1 times [2019-10-22 08:57:15,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965960668] [2019-10-22 08:57:15,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,360 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1183926615, now seen corresponding path program 1 times [2019-10-22 08:57:15,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119541302] [2019-10-22 08:57:15,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:15,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119541302] [2019-10-22 08:57:15,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:15,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:15,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723187960] [2019-10-22 08:57:15,620 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-10-22 08:57:15,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:15,742 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 08:57:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:15,790 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-10-22 08:57:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:57:15,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-10-22 08:57:15,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:15,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 14 transitions. [2019-10-22 08:57:15,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:57:15,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:57:15,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2019-10-22 08:57:15,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:15,792 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-22 08:57:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2019-10-22 08:57:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-10-22 08:57:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:57:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-10-22 08:57:15,794 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:57:15,794 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:57:15,794 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:15,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-10-22 08:57:15,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:15,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:15,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:15,796 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:15,796 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:15,796 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet12, main_#t~ret13.base, main_#t~ret13.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8; 187#L522 assume !(main_~length~0 < 1); 191#L522-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 192#L527-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet11, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 193#L527-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 194#L527-3 assume !(main_~i~0 < main_~length~0 - 1); 195#L527-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet12;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset, cstrchr_#t~mem2, cstrchr_#t~mem3, cstrchr_#t~short4, cstrchr_#t~mem6, cstrchr_#t~ite7.base, cstrchr_#t~ite7.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 196#L516-5 [2019-10-22 08:57:15,796 INFO L793 eck$LassoCheckResult]: Loop: 196#L516-5 call cstrchr_#t~mem2 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1);cstrchr_#t~short4 := 0 != cstrchr_#t~mem2; 189#L516-1 assume cstrchr_#t~short4;call cstrchr_#t~mem3 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1);cstrchr_#t~short4 := cstrchr_#t~mem3 != (if cstrchr_~c % 256 <= 127 then cstrchr_~c % 256 else cstrchr_~c % 256 - 256); 190#L516-3 assume !!cstrchr_#t~short4;havoc cstrchr_#t~short4;havoc cstrchr_#t~mem2;havoc cstrchr_#t~mem3;cstrchr_#t~post5.base, cstrchr_#t~post5.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post5.base, 1 + cstrchr_#t~post5.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset; 196#L516-5 [2019-10-22 08:57:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 08:57:15,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916384943] [2019-10-22 08:57:15,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,830 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash 57699, now seen corresponding path program 2 times [2019-10-22 08:57:15,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776850648] [2019-10-22 08:57:15,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1235380661, now seen corresponding path program 1 times [2019-10-22 08:57:15,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:15,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995357159] [2019-10-22 08:57:15,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:15,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:15,903 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:16,087 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-10-22 08:57:16,257 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-10-22 08:57:16,322 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:16,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:16,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:16,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:16,323 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:16,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:16,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:16,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:16,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrchr-alloca-2.i_Iteration4_Lasso [2019-10-22 08:57:16,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:16,323 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:16,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:16,982 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:57:17,071 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:17,071 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:17,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,106 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,106 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,119 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,128 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,129 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,129 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,132 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,140 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,147 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,147 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,151 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,152 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,155 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,161 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,161 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,168 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,170 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,171 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,174 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,174 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:17,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:17,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:17,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,181 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,181 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,188 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:57:17,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,217 INFO L400 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2019-10-22 08:57:17,217 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-10-22 08:57:17,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,363 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:17,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,365 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:17,365 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,374 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,374 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:17,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:17,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:17,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:17,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:17,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:17,378 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:17,378 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:17,394 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:17,430 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:17,430 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:57:17,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:17,432 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:17,432 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:17,433 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start_cstrchr_~s.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start_cstrchr_~s.base)_1 Supporting invariants [] [2019-10-22 08:57:17,443 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:57:17,444 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:57:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:17,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:17,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:17,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:17,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:17,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:17,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:57:17,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 14 states and 17 transitions. Complement of second has 4 states. [2019-10-22 08:57:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-10-22 08:57:17,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:57:17,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:17,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:57:17,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:17,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:57:17,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:17,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-10-22 08:57:17,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:17,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-10-22 08:57:17,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:17,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:17,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:17,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:17,547 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:17,547 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:17,547 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:17,547 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:17,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:17,547 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:17,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:17,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:17 BoogieIcfgContainer [2019-10-22 08:57:17,556 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:17,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:17,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:17,556 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:17,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:13" (3/4) ... [2019-10-22 08:57:17,561 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:17,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:17,563 INFO L168 Benchmark]: Toolchain (without parser) took 4711.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -220.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:17,564 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:17,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:17,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.09 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:17,567 INFO L168 Benchmark]: Boogie Preprocessor took 32.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:17,568 INFO L168 Benchmark]: RCFGBuilder took 438.18 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:17,569 INFO L168 Benchmark]: BuchiAutomizer took 3657.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:17,570 INFO L168 Benchmark]: Witness Printer took 5.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:17,573 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 529.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.09 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 438.18 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3657.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 45 SDtfs, 46 SDslu, 44 SDs, 0 SdLazy, 49 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax114 hnf99 lsp84 ukn77 mio100 lsp52 div106 bol100 ite100 ukn100 eq161 hnf90 smp96 dnf394 smp63 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 167ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 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...