./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/build_fullname.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/build_fullname.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/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 64bit --witnessprinter.graph.data.programhash d5a9d2464f90cb604e81a75f4f55e926d182d9fa ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54:47,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:47,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:47,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:47,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:47,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:47,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:47,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:47,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:47,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:47,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:47,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:47,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:47,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:47,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:47,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:47,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:47,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:47,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:47,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:47,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:47,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:47,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:47,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:47,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:47,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:47,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:47,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:47,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:47,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:47,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:47,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:47,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:47,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:47,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:47,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:47,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:47,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:47,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:47,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:47,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:47,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:47,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:47,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:47,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:47,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:47,943 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:47,943 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:47,943 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:47,943 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:47,944 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:47,944 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:47,944 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:47,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:47,944 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:47,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:47,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:47,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:47,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:47,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:47,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:47,946 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:47,947 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:47,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:47,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:47,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:47,948 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:47,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:47,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:47,948 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:47,949 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:47,949 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_e0f52487-72a6-4605-a28b-d6f1ed806f23/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5a9d2464f90cb604e81a75f4f55e926d182d9fa [2019-10-22 08:54:47,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:47,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:47,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:47,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:48,000 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:48,001 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/build_fullname.i [2019-10-22 08:54:48,046 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/data/fe4ebce93/1c571e5cf9bd4bd6a99e2e6558ce476b/FLAG36f5dc922 [2019-10-22 08:54:48,486 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:48,487 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/sv-benchmarks/c/termination-libowfat/build_fullname.i [2019-10-22 08:54:48,498 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/data/fe4ebce93/1c571e5cf9bd4bd6a99e2e6558ce476b/FLAG36f5dc922 [2019-10-22 08:54:48,508 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/data/fe4ebce93/1c571e5cf9bd4bd6a99e2e6558ce476b [2019-10-22 08:54:48,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:48,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:48,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:48,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:48,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:48,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53fcfe26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48, skipping insertion in model container [2019-10-22 08:54:48,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,527 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:48,559 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:48,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:48,916 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:48,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:49,006 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:49,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49 WrapperNode [2019-10-22 08:54:49,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:49,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:49,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:49,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:49,015 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:54:49" (1/1) ... [2019-10-22 08:54:49,029 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:54:49" (1/1) ... [2019-10-22 08:54:49,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:49,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:49,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:49,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:49,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:49,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:49,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:49,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:49,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/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:54:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:49,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:49,509 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:49,509 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 08:54:49,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:49 BoogieIcfgContainer [2019-10-22 08:54:49,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:49,511 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:49,511 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:49,514 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:49,515 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:49,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:48" (1/3) ... [2019-10-22 08:54:49,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d36267a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:49, skipping insertion in model container [2019-10-22 08:54:49,516 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:49,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (2/3) ... [2019-10-22 08:54:49,517 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d36267a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:49, skipping insertion in model container [2019-10-22 08:54:49,517 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:49,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:49" (3/3) ... [2019-10-22 08:54:49,519 INFO L371 chiAutomizerObserver]: Analyzing ICFG build_fullname.i [2019-10-22 08:54:49,564 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:49,564 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:49,564 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:49,564 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:49,566 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:49,566 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:49,566 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:49,566 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:49,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-10-22 08:54:49,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:54:49,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,601 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,601 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:49,601 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:49,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-10-22 08:54:49,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:54:49,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:49,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:49,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:49,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:49,611 INFO L791 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 9#L532true assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 20#L534true assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 10#L521true assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 13#L521-2true assume build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset; 14#L523-4true strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 24#L508-8true [2019-10-22 08:54:49,612 INFO L793 eck$LassoCheckResult]: Loop: 24#L508-8true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 7#L508-6true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 24#L508-8true [2019-10-22 08:54:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905919, now seen corresponding path program 1 times [2019-10-22 08:54:49,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872681188] [2019-10-22 08:54:49,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,824 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 1 times [2019-10-22 08:54:49,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667262563] [2019-10-22 08:54:49,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,854 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:49,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1269803204, now seen corresponding path program 1 times [2019-10-22 08:54:49,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712761394] [2019-10-22 08:54:49,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:49,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,025 WARN L191 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 154 [2019-10-22 08:54:51,415 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-10-22 08:54:51,428 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:51,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:51,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:51,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:51,429 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:51,429 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:51,429 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:51,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:51,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration1_Lasso [2019-10-22 08:54:51,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:51,431 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:51,464 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:54:51,470 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:54:51,472 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:54:51,478 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:54:51,480 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:54:51,483 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:54:51,486 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:54:51,488 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:54:51,491 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:54:51,493 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:54:51,495 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:54:51,499 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:54:51,502 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:54:51,506 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:54:51,508 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:54:51,511 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:54:52,313 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 121 [2019-10-22 08:54:52,480 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-22 08:54:52,481 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:54:52,484 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:54:52,487 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:54:52,488 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:54:52,490 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:54:52,492 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:54:52,495 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:54:52,497 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:54:52,499 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:54:52,500 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:54:52,502 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:54:52,504 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:54:52,506 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:54:52,792 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 08:54:54,072 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-10-22 08:54:54,203 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 08:54:54,285 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:54,289 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:54,291 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:54:54,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,296 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,299 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:54:54,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,300 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,301 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,302 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:54:54,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:54,305 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,311 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:54:54,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,313 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,314 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:54:54,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,316 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,317 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:54:54,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,317 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,318 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,320 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:54:54,320 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,322 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:54:54,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,323 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,324 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,325 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:54:54,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,327 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,327 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:54:54,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,330 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:54:54,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,333 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:54:54,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,335 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:54:54,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,338 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:54:54,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,339 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,341 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:54:54,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,344 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:54:54,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,347 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:54,347 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,378 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:54:54,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,379 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-10-22 08:54:54,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,396 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 08:54:54,398 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,534 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:54:54,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,535 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:54,536 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,540 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:54:54,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:54,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:54,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:54,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,542 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:54:54,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,544 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:54,544 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,545 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:54:54,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,548 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:54,551 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:54,554 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:54:54,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:54,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:54,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:54,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:54,561 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:54,561 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:54,617 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:54,653 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:54,656 INFO L444 ModelExtractionUtils]: 75 out of 79 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:54,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:54,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:54,660 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:54,661 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_1, ULTIMATE.start_strcpy_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_1 - 1*ULTIMATE.start_strcpy_~s2.offset Supporting invariants [] [2019-10-22 08:54:54,784 INFO L297 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2019-10-22 08:54:54,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:54,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:54,889 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:54:54,903 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:54:54,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 3 states. [2019-10-22 08:54:54,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 3 states. Result 54 states and 72 transitions. Complement of second has 5 states. [2019-10-22 08:54:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2019-10-22 08:54:54,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:54,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:54:54,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:54:54,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:54,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2019-10-22 08:54:54,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:54,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 15 states and 18 transitions. [2019-10-22 08:54:54,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:54:54,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:54:54,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-10-22 08:54:54,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:54,973 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:54:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-10-22 08:54:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 08:54:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:54:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-10-22 08:54:54,997 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:54:54,997 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:54:54,997 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:54,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-10-22 08:54:54,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:54,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:54,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:54,999 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:55,000 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:55,000 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 283#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 278#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 279#L521 assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 284#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 280#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 281#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 271#L508-3 [2019-10-22 08:54:55,000 INFO L793 eck$LassoCheckResult]: Loop: 271#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 272#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 271#L508-3 [2019-10-22 08:54:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2019-10-22 08:54:55,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88741345] [2019-10-22 08:54:55,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:55,086 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:54:55,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88741345] [2019-10-22 08:54:55,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:55,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:55,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063209436] [2019-10-22 08:54:55,089 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2019-10-22 08:54:55,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930662726] [2019-10-22 08:54:55,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,108 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:55,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:55,191 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 08:54:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:55,243 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-10-22 08:54:55,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:55,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-10-22 08:54:55,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:55,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-10-22 08:54:55,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:54:55,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:54:55,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-10-22 08:54:55,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:55,247 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:54:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-10-22 08:54:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-10-22 08:54:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:54:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:54:55,249 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:54:55,249 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:54:55,249 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:55,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:54:55,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:55,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:55,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:55,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:55,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:55,252 INFO L791 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 328#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 323#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 324#L521 assume !build_fullname_#t~short10; 329#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 332#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 326#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 316#L508-3 [2019-10-22 08:54:55,252 INFO L793 eck$LassoCheckResult]: Loop: 316#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 317#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 316#L508-3 [2019-10-22 08:54:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2019-10-22 08:54:55,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358399798] [2019-10-22 08:54:55,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,293 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 2 times [2019-10-22 08:54:55,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282407529] [2019-10-22 08:54:55,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,308 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:55,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash 766789687, now seen corresponding path program 1 times [2019-10-22 08:54:55,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835586291] [2019-10-22 08:54:55,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:55,343 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:56,137 WARN L191 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 153 [2019-10-22 08:54:56,426 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-10-22 08:54:56,428 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:56,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:56,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:56,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:56,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:56,429 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:56,429 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:56,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:56,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration3_Lasso [2019-10-22 08:54:56,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:56,429 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:56,433 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:54:56,434 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:54:56,436 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:54:56,438 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:54:56,440 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:54:56,441 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:54:56,443 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:54:56,444 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:54:56,445 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:54:56,447 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:54:56,449 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:54:56,450 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:54:56,452 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:54:56,453 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:54:56,455 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:54:56,456 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:54:56,458 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:54:56,459 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:54:56,460 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:54:56,462 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:54:56,464 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:54:56,465 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:54:57,011 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 127 [2019-10-22 08:54:57,174 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-10-22 08:54:57,174 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:54:57,176 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:54:57,178 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:54:57,179 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:54:57,180 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:54:57,181 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:54:57,182 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:54:57,183 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:54:57,373 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-22 08:54:58,871 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-10-22 08:54:58,932 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:58,932 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:58,932 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:54:58,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,934 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,935 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:54:58,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,937 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,937 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,938 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:54:58,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,939 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,939 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:58,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,942 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:54:58,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,943 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,943 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,943 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,944 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:54:58,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,946 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:54:58,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,947 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,948 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:54:58,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,949 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,950 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:54:58,951 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,952 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:54:58,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,953 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,953 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,955 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:54:58,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,956 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:54:58,957 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,957 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,958 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,958 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,959 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:54:58,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,961 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:54:58,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,963 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:54:58,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,965 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:54:58,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,966 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,966 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,967 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:54:58,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,968 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,968 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,969 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:54:58,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,972 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:54:58,972 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,972 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,973 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,974 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:54:58,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,975 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,975 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:58,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,977 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:54:58,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,979 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:54:58,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:58,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,979 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:58,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:58,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,980 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:54:58,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,982 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,982 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:58,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:58,985 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:54:58,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:58,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:58,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:58,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:58,989 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:58,989 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:59,041 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:59,143 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-10-22 08:54:59,143 INFO L444 ModelExtractionUtils]: 53 out of 61 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:54:59,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:59,144 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:59,144 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:59,144 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2 Supporting invariants [] [2019-10-22 08:54:59,263 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2019-10-22 08:54:59,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:54:59,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:54:59,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:59,350 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:54:59,350 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-10-22 08:54:59,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:54:59,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 24 states and 28 transitions. Complement of second has 5 states. [2019-10-22 08:54:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 08:54:59,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:54:59,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:59,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 08:54:59,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:59,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 08:54:59,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:59,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-10-22 08:54:59,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:59,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-10-22 08:54:59,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:54:59,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:54:59,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 08:54:59,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:59,404 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:54:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 08:54:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:54:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:54:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:54:59,425 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:54:59,425 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:54:59,425 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:59,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-10-22 08:54:59,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:59,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:59,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:59,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:59,426 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:59,427 INFO L791 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 563#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 564#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 559#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 560#L521 assume !build_fullname_#t~short10; 565#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 568#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 562#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 551#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 552#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 556#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 557#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 558#L514-2 [2019-10-22 08:54:59,427 INFO L793 eck$LassoCheckResult]: Loop: 558#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 554#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 555#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 558#L514-2 [2019-10-22 08:54:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1849486153, now seen corresponding path program 1 times [2019-10-22 08:54:59,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112729174] [2019-10-22 08:54:59,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,485 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:54:59,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112729174] [2019-10-22 08:54:59,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:59,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:59,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520463332] [2019-10-22 08:54:59,486 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 1 times [2019-10-22 08:54:59,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509765307] [2019-10-22 08:54:59,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,495 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:59,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:59,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:59,535 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-10-22 08:54:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:59,605 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-10-22 08:54:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:59,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-10-22 08:54:59,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:59,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 08:54:59,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:54:59,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:54:59,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-10-22 08:54:59,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:59,607 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:54:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-10-22 08:54:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-22 08:54:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:54:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-22 08:54:59,609 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-22 08:54:59,609 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-22 08:54:59,609 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:59,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-10-22 08:54:59,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:59,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:59,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:59,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:59,614 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:59,614 INFO L791 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 617#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 618#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 613#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 614#L521 assume !build_fullname_#t~short10; 619#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 624#L523 assume build_fullname_#t~short14; 616#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 623#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 607#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 610#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 611#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 612#L514-2 [2019-10-22 08:54:59,614 INFO L793 eck$LassoCheckResult]: Loop: 612#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 608#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 609#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 612#L514-2 [2019-10-22 08:54:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1906744455, now seen corresponding path program 1 times [2019-10-22 08:54:59,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055383996] [2019-10-22 08:54:59,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,651 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 2 times [2019-10-22 08:54:59,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088687952] [2019-10-22 08:54:59,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:59,657 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1413453764, now seen corresponding path program 1 times [2019-10-22 08:54:59,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894233347] [2019-10-22 08:54:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,699 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:54:59,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894233347] [2019-10-22 08:54:59,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:59,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:59,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636631455] [2019-10-22 08:54:59,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:59,729 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 08:54:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:59,798 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-22 08:54:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:59,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-10-22 08:54:59,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:59,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 25 transitions. [2019-10-22 08:54:59,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:54:59,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:54:59,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-10-22 08:54:59,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:59,801 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:54:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-10-22 08:54:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-10-22 08:54:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:54:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-10-22 08:54:59,802 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-10-22 08:54:59,802 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-10-22 08:54:59,802 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:59,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-10-22 08:54:59,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:59,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:59,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:59,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:59,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:59,803 INFO L791 eck$LassoCheckResult]: Stem: 685#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 681#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 682#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 677#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 678#L521 assume !build_fullname_#t~short10; 683#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 686#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 680#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 668#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 669#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 670#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 671#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 674#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 675#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 676#L514-2 [2019-10-22 08:54:59,803 INFO L793 eck$LassoCheckResult]: Loop: 676#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 672#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 673#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 676#L514-2 [2019-10-22 08:54:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash 761840220, now seen corresponding path program 1 times [2019-10-22 08:54:59,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520568755] [2019-10-22 08:54:59,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:59,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520568755] [2019-10-22 08:54:59,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62753366] [2019-10-22 08:54:59,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0f52487-72a6-4605-a28b-d6f1ed806f23/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-22 08:54:59,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:59,997 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-10-22 08:54:59,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-10-22 08:54:59,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:00,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:00,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:00,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:27 [2019-10-22 08:55:00,174 INFO L341 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2019-10-22 08:55:00,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 48 [2019-10-22 08:55:00,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:00,192 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-10-22 08:55:00,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:00,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-10-22 08:55:00,256 INFO L341 Elim1Store]: treesize reduction 14, result has 67.4 percent of original size [2019-10-22 08:55:00,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 42 [2019-10-22 08:55:00,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:00,267 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-10-22 08:55:00,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:00,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:4 [2019-10-22 08:55:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:00,269 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:00,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-10-22 08:55:00,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812120757] [2019-10-22 08:55:00,270 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 3 times [2019-10-22 08:55:00,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:00,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657793545] [2019-10-22 08:55:00,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,281 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:00,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:00,317 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-10-22 08:55:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:00,532 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-10-22 08:55:00,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:00,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-10-22 08:55:00,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:00,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2019-10-22 08:55:00,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 08:55:00,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:55:00,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-10-22 08:55:00,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:00,534 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-22 08:55:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-10-22 08:55:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-10-22 08:55:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:55:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-22 08:55:00,537 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-22 08:55:00,537 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-22 08:55:00,537 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:00,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-10-22 08:55:00,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:00,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:00,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:00,538 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:00,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:00,538 INFO L791 eck$LassoCheckResult]: Stem: 791#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 787#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 788#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 783#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 784#L521 assume !build_fullname_#t~short10; 789#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem8;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 797#L523 assume build_fullname_#t~short14; 786#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 775#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 776#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 792#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 793#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 780#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 781#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 782#L514-2 [2019-10-22 08:55:00,538 INFO L793 eck$LassoCheckResult]: Loop: 782#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 778#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 779#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 782#L514-2 [2019-10-22 08:55:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1571186846, now seen corresponding path program 1 times [2019-10-22 08:55:00,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:00,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181098655] [2019-10-22 08:55:00,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,573 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 4 times [2019-10-22 08:55:00,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:00,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328934413] [2019-10-22 08:55:00,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash 673793151, now seen corresponding path program 1 times [2019-10-22 08:55:00,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:00,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67826919] [2019-10-22 08:55:00,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:00,638 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:01,990 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 273 DAG size of output: 230 [2019-10-22 08:55:03,097 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 182 DAG size of output: 174 [2019-10-22 08:55:03,103 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:03,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:03,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:03,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:03,104 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:03,104 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:03,104 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:03,104 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:03,104 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration7_Lasso [2019-10-22 08:55:03,104 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:03,104 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:03,108 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:55:03,113 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:55:03,115 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:55:03,116 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:55:03,117 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:55:03,122 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:55:03,123 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:55:03,125 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:55:03,126 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:55:03,127 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:55:03,129 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:55:03,130 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:55:03,133 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:55:03,134 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:55:03,136 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:55:03,138 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:55:03,140 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:55:03,142 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:55:03,143 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:55:03,145 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:55:03,146 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:55:03,147 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:55:03,149 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:55:03,150 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:55:03,152 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:55:03,153 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:55:03,156 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:55:03,158 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:55:03,160 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:55:03,162 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:55:03,164 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:55:03,165 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:55:03,167 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:55:03,875 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 146 [2019-10-22 08:55:04,275 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-10-22 08:55:04,599 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 08:55:06,122 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-10-22 08:55:06,138 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:06,138 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:06,138 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:55:06,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,140 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:55:06,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,141 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,143 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:55:06,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,144 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:55:06,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,145 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,147 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:55:06,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,147 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,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:55:06,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,150 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:55:06,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,151 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,151 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,152 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:55:06,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,154 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:55:06,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,155 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:55:06,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,156 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,157 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:55:06,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,157 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,159 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,159 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,159 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:55:06,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,161 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,161 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,162 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:55:06,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,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:55:06,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,166 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:55:06,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,168 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:55:06,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,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:55:06,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,170 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,171 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,171 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:55:06,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,173 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:55:06,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,175 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,175 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,175 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:55:06,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,177 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:55:06,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,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:55:06,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,180 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:55:06,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,183 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:55:06,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,184 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,184 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:55:06,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,185 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,186 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:55:06,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,187 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,189 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:55:06,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,190 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,190 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,191 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:55:06,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,192 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,193 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:55:06,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,195 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:55:06,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,197 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:55:06,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,199 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:55:06,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,199 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,201 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:55:06,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,202 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,202 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,204 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:55:06,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,206 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,206 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,209 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:55:06,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,211 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,211 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,212 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:55:06,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,213 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:06,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:06,214 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:06,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,215 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:55:06,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,218 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:55:06,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,219 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,220 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:06,221 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:55:06,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:06,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:06,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:06,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:06,225 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:06,225 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:06,254 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:06,311 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-10-22 08:55:06,311 INFO L444 ModelExtractionUtils]: 78 out of 88 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-10-22 08:55:06,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:06,312 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:06,313 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:06,313 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strchr_~t.offset, v_rep(select #length ULTIMATE.start_strchr_~t.base)_1) = -1*ULTIMATE.start_strchr_~t.offset + 1*v_rep(select #length ULTIMATE.start_strchr_~t.base)_1 Supporting invariants [] [2019-10-22 08:55:06,465 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-10-22 08:55:06,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:06,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:06,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:06,520 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:55:06,520 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:55:06,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:55:06,532 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 26 states and 30 transitions. Complement of second has 4 states. [2019-10-22 08:55:06,533 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:55:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:55:06,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:55:06,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:06,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2019-10-22 08:55:06,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:06,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-10-22 08:55:06,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:06,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-10-22 08:55:06,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:06,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-10-22 08:55:06,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:06,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:06,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:06,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:06,535 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:06,535 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:06,535 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:06,535 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:55:06,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:06,536 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:06,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:06,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:06 BoogieIcfgContainer [2019-10-22 08:55:06,543 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:06,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:06,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:06,543 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:06,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:49" (3/4) ... [2019-10-22 08:55:06,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:06,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:06,549 INFO L168 Benchmark]: Toolchain (without parser) took 18037.12 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 492.8 MB). Free memory was 948.7 MB in the beginning and 946.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 495.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:06,550 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:06,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.4 MB in the beginning and 1.2 GB in the end (delta: -204.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:06,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:06,553 INFO L168 Benchmark]: Boogie Preprocessor took 51.22 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:06,554 INFO L168 Benchmark]: RCFGBuilder took 401.52 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:06,555 INFO L168 Benchmark]: BuchiAutomizer took 17031.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.0 MB). Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 167.9 MB). Peak memory consumption was 491.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:06,555 INFO L168 Benchmark]: Witness Printer took 4.70 ms. Allocated memory is still 1.5 GB. Free memory is still 946.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:06,558 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 493.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.4 MB in the beginning and 1.2 GB in the end (delta: -204.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.22 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 401.52 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17031.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.0 MB). Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 167.9 MB). Peak memory consumption was 491.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.70 ms. Allocated memory is still 1.5 GB. Free memory is still 946.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s2 and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 4 locations. One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[t] and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 16.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 102 SDslu, 163 SDs, 0 SdLazy, 206 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital474 mio100 ax100 hnf99 lsp98 ukn65 mio100 lsp44 div100 bol100 ite100 ukn100 eq203 hnf85 smp98 dnf457 smp97 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 149ms VariablesStem: 19 VariablesLoop: 10 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...