./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 29f46a81991b9bc0fef856343662e1cc264d2d45 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:05:48,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:05:48,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:05:48,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:05:48,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:05:48,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:05:48,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:05:48,981 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:05:48,982 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:05:48,983 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:05:48,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:05:48,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:05:48,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:05:48,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:05:48,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:05:48,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:05:48,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:05:48,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:05:48,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:05:48,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:05:48,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:05:48,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:05:48,995 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:05:48,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:05:48,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:05:48,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:05:48,996 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:05:48,997 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:05:48,998 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:05:48,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:05:48,999 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:05:48,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:05:48,999 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:05:49,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:05:49,000 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:05:49,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:05:49,001 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 04:05:49,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:05:49,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:05:49,014 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:05:49,014 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:05:49,014 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 04:05:49,014 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 04:05:49,014 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 04:05:49,014 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 04:05:49,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 04:05:49,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 04:05:49,016 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 04:05:49,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:05:49,016 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 04:05:49,016 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:05:49,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 04:05:49,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:05:49,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:05:49,017 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 04:05:49,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:05:49,017 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 04:05:49,017 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 04:05:49,018 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 04:05:49,018 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29f46a81991b9bc0fef856343662e1cc264d2d45 [2018-12-02 04:05:49,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:05:49,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:05:49,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:05:49,052 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:05:49,053 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:05:49,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-12-02 04:05:49,088 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/data/046e3149a/9d439e861b904421abbf32d50115c42b/FLAG57049131c [2018-12-02 04:05:49,581 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:05:49,582 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-12-02 04:05:49,587 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/data/046e3149a/9d439e861b904421abbf32d50115c42b/FLAG57049131c [2018-12-02 04:05:49,596 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/data/046e3149a/9d439e861b904421abbf32d50115c42b [2018-12-02 04:05:49,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:05:49,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:05:49,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:05:49,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:05:49,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:05:49,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ceaa519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49, skipping insertion in model container [2018-12-02 04:05:49,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:05:49,624 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:05:49,763 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:05:49,769 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:05:49,835 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:05:49,855 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:05:49,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49 WrapperNode [2018-12-02 04:05:49,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:05:49,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:05:49,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:05:49,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:05:49,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:05:49,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:05:49,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:05:49,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:05:49,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... [2018-12-02 04:05:49,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:05:49,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:05:49,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:05:49,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:05:49,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80b74b98-88b6-44b2-833c-91603686fcba/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:05:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:05:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 04:05:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:05:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:05:49,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:05:49,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:05:50,060 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:05:50,061 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 04:05:50,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:05:50 BoogieIcfgContainer [2018-12-02 04:05:50,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:05:50,061 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 04:05:50,061 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 04:05:50,065 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 04:05:50,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:05:50,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 04:05:49" (1/3) ... [2018-12-02 04:05:50,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290f8478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:05:50, skipping insertion in model container [2018-12-02 04:05:50,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:05:50,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:05:49" (2/3) ... [2018-12-02 04:05:50,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@290f8478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:05:50, skipping insertion in model container [2018-12-02 04:05:50,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:05:50,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:05:50" (3/3) ... [2018-12-02 04:05:50,069 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-termination.c.i [2018-12-02 04:05:50,115 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:05:50,116 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 04:05:50,116 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 04:05:50,116 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 04:05:50,116 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:05:50,116 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:05:50,116 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 04:05:50,116 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:05:50,116 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 04:05:50,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 04:05:50,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:05:50,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:05:50,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:05:50,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 04:05:50,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 04:05:50,147 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 04:05:50,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-02 04:05:50,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:05:50,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:05:50,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:05:50,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 04:05:50,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 04:05:50,155 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 8#L568-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 4#L550-3true [2018-12-02 04:05:50,155 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 19#L550-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 3#L553-5true assume !true; 5#L553-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 6#L557true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 4#L550-3true [2018-12-02 04:05:50,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 04:05:50,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:50,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2018-12-02 04:05:50,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:50,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:50,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:05:50,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:05:50,279 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 04:05:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 04:05:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 04:05:50,289 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-02 04:05:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:05:50,293 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-02 04:05:50,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 04:05:50,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-02 04:05:50,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:05:50,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2018-12-02 04:05:50,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 04:05:50,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 04:05:50,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-02 04:05:50,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:05:50,299 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 04:05:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-02 04:05:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-02 04:05:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 04:05:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-12-02 04:05:50,319 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 04:05:50,319 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-02 04:05:50,319 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 04:05:50,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-12-02 04:05:50,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 04:05:50,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:05:50,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:05:50,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 04:05:50,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:05:50,320 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 44#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 45#L565 assume !(main_~length1~0 < 1); 49#L565-2 assume !(main_~length2~0 < 1); 50#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 51#L550-3 [2018-12-02 04:05:50,321 INFO L796 eck$LassoCheckResult]: Loop: 51#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 52#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 42#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 43#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L553-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5; 46#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 47#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 51#L550-3 [2018-12-02 04:05:50,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 04:05:50,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:50,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2018-12-02 04:05:50,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:50,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:05:50,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2018-12-02 04:05:50,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:50,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:50,529 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-02 04:05:50,734 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-02 04:05:50,806 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:05:50,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:05:50,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:05:50,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:05:50,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:05:50,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:05:50,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:05:50,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:05:50,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 04:05:50,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:05:50,808 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:05:50,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:50,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:50,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:50,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:51,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:05:51,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:05:51,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:51,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:51,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:51,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:51,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:51,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:51,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:51,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:51,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,467 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:05:51,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,469 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:05:51,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:51,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:51,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,481 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-02 04:05:51,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,483 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 04:05:51,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:51,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:51,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:51,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:51,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:51,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:51,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:51,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:51,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:51,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:51,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:51,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:51,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:51,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:51,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:51,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:51,518 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:05:51,527 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 04:05:51,528 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:05:51,530 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:05:51,530 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 04:05:51,531 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:05:51,531 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-12-02 04:05:51,561 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 04:05:51,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 04:05:51,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:51,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:51,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:51,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 04:05:51,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 04:05:51,684 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2018-12-02 04:05:51,684 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 [2018-12-02 04:05:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:05:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-02 04:05:51,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2018-12-02 04:05:51,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:51,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-12-02 04:05:51,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:51,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-02 04:05:51,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:51,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-12-02 04:05:51,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 04:05:51,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2018-12-02 04:05:51,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 04:05:51,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 04:05:51,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-12-02 04:05:51,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:05:51,688 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 04:05:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-12-02 04:05:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-02 04:05:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 04:05:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-12-02 04:05:51,689 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 04:05:51,689 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 04:05:51,690 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 04:05:51,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-12-02 04:05:51,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 04:05:51,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:05:51,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:05:51,690 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:05:51,690 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 04:05:51,690 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L565 assume !(main_~length1~0 < 1); 183#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 178#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 180#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 170#L553-5 [2018-12-02 04:05:51,690 INFO L796 eck$LassoCheckResult]: Loop: 170#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 171#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 170#L553-5 [2018-12-02 04:05:51,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-02 04:05:51,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:51,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2018-12-02 04:05:51,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:51,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:51,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:51,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2018-12-02 04:05:51,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:51,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:51,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:51,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:51,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:51,982 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-12-02 04:05:52,054 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:05:52,054 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:05:52,054 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:05:52,054 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:05:52,054 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:05:52,055 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:05:52,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:05:52,055 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:05:52,055 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 04:05:52,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:05:52,055 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:05:52,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,284 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-12-02 04:05:52,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:52,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:05:52,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:05:52,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:52,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:52,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:52,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:52,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:52,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:52,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:52,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:52,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:52,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:52,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:52,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:52,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:52,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:52,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:52,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:52,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:52,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,773 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:05:52,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,775 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:05:52,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:52,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:52,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:52,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:52,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:52,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:52,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:52,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:52,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:52,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:52,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:52,829 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:05:52,851 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 04:05:52,851 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 04:05:52,852 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:05:52,852 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 04:05:52,853 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:05:52,853 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-12-02 04:05:52,913 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2018-12-02 04:05:52,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 04:05:52,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:52,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:52,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:52,970 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 [2018-12-02 04:05:52,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 04:05:53,006 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 59 states and 76 transitions. Complement of second has 8 states. [2018-12-02 04:05:53,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:05:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:05:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-02 04:05:53,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 04:05:53,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:53,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 04:05:53,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:53,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 04:05:53,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:53,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2018-12-02 04:05:53,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 04:05:53,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2018-12-02 04:05:53,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 04:05:53,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-02 04:05:53,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2018-12-02 04:05:53,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:05:53,012 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2018-12-02 04:05:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2018-12-02 04:05:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-12-02 04:05:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 04:05:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-12-02 04:05:53,015 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-02 04:05:53,016 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-12-02 04:05:53,016 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 04:05:53,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2018-12-02 04:05:53,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-02 04:05:53,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:05:53,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:05:53,017 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:05:53,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 04:05:53,017 INFO L794 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 404#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 405#L565 assume !(main_~length1~0 < 1); 407#L565-2 assume !(main_~length2~0 < 1); 408#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 411#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 413#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 422#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 401#L553-1 [2018-12-02 04:05:53,017 INFO L796 eck$LassoCheckResult]: Loop: 401#L553-1 assume !substring_#t~short6; 417#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 400#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 401#L553-1 [2018-12-02 04:05:53,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:53,018 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2018-12-02 04:05:53,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:53,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:53,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:53,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2018-12-02 04:05:53,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:05:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:05:53,040 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 04:05:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:05:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:05:53,040 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-12-02 04:05:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:05:53,052 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-12-02 04:05:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:05:53,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-12-02 04:05:53,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 04:05:53,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2018-12-02 04:05:53,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 04:05:53,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 04:05:53,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-12-02 04:05:53,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:05:53,054 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-02 04:05:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-12-02 04:05:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-02 04:05:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 04:05:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-02 04:05:53,055 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-02 04:05:53,055 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-02 04:05:53,055 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 04:05:53,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-02 04:05:53,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 04:05:53,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:05:53,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:05:53,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:05:53,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 04:05:53,056 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 482#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 483#L565 assume !(main_~length1~0 < 1); 492#L565-2 assume !(main_~length2~0 < 1); 493#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 484#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 485#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 498#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 495#L553-1 assume !substring_#t~short6; 496#L553-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5; 489#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 490#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 486#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 487#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 478#L553-5 [2018-12-02 04:05:53,056 INFO L796 eck$LassoCheckResult]: Loop: 478#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 479#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 494#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 478#L553-5 [2018-12-02 04:05:53,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2018-12-02 04:05:53,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:53,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:53,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:05:53,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:05:53,079 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:05:53,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2018-12-02 04:05:53,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:53,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:05:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:05:53,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:05:53,167 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-02 04:05:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:05:53,188 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-12-02 04:05:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:05:53,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-12-02 04:05:53,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 04:05:53,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2018-12-02 04:05:53,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 04:05:53,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 04:05:53,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-12-02 04:05:53,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 04:05:53,190 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-02 04:05:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-12-02 04:05:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 04:05:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 04:05:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-02 04:05:53,192 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-02 04:05:53,192 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-02 04:05:53,192 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 04:05:53,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-12-02 04:05:53,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 04:05:53,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:05:53,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:05:53,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:05:53,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 04:05:53,193 INFO L794 eck$LassoCheckResult]: Stem: 552#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 541#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 542#L565 assume !(main_~length1~0 < 1); 543#L565-2 assume !(main_~length2~0 < 1); 544#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 545#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 546#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 557#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 554#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 555#L553-3 assume !substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5; 550#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 551#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 547#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 548#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 537#L553-5 [2018-12-02 04:05:53,193 INFO L796 eck$LassoCheckResult]: Loop: 537#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 538#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 553#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 537#L553-5 [2018-12-02 04:05:53,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2018-12-02 04:05:53,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:53,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:05:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2018-12-02 04:05:53,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:53,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:53,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:05:53,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2018-12-02 04:05:53,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:05:53,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:05:53,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:05:53,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:05:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:05:53,712 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 143 [2018-12-02 04:05:53,804 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:05:53,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:05:53,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:05:53,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:05:53,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:05:53,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:05:53,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:05:53,805 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:05:53,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-02 04:05:53,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:05:53,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:05:53,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:53,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,228 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-12-02 04:05:54,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:05:54,830 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-02 04:05:54,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:05:54,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:05:54,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:54,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:54,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:54,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:54,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:54,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:54,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:54,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:54,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:05:54,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:05:54,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:05:54,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:54,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:54,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:54,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:54,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:54,994 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:05:54,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:54,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:54,995 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:05:54,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:54,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:54,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:55,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:55,000 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-02 04:05:55,000 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 04:05:55,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:55,005 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-12-02 04:05:55,005 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 04:05:55,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:55,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:55,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:55,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:55,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:55,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:55,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:55,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:55,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:55,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:55,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:55,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:55,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:55,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:55,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:55,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:55,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:55,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:55,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:55,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:55,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:55,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:55,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:55,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:55,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:55,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:55,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:55,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:55,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:55,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:55,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:55,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:55,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:55,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:55,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:55,033 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:05:55,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:55,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:55,034 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:05:55,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:55,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:05:55,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:05:55,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:05:55,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:05:55,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:05:55,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:05:55,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:05:55,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:05:55,066 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:05:55,077 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 04:05:55,077 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:05:55,078 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:05:55,078 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 04:05:55,078 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:05:55,078 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2018-12-02 04:05:55,196 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2018-12-02 04:05:55,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 04:05:55,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:55,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:55,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:55,255 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 [2018-12-02 04:05:55,255 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-02 04:05:55,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 43 transitions. Complement of second has 8 states. [2018-12-02 04:05:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:05:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:05:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-02 04:05:55,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 04:05:55,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:55,286 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:05:55,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:55,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:55,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:55,336 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 04:05:55,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-02 04:05:55,359 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 43 transitions. Complement of second has 8 states. [2018-12-02 04:05:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:05:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:05:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-02 04:05:55,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 04:05:55,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:55,359 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 04:05:55,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:05:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:55,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:05:55,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:05:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:05:55,406 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 04:05:55,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-02 04:05:55,433 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 44 transitions. Complement of second has 7 states. [2018-12-02 04:05:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:05:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 04:05:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-02 04:05:55,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 04:05:55,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:55,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-02 04:05:55,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:55,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-02 04:05:55,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:05:55,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-12-02 04:05:55,436 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:05:55,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-12-02 04:05:55,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 04:05:55,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 04:05:55,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 04:05:55,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:05:55,437 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:05:55,437 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:05:55,437 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:05:55,437 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 04:05:55,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:05:55,437 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:05:55,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 04:05:55,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 04:05:55 BoogieIcfgContainer [2018-12-02 04:05:55,442 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 04:05:55,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:05:55,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:05:55,442 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:05:55,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:05:50" (3/4) ... [2018-12-02 04:05:55,445 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:05:55,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:05:55,445 INFO L168 Benchmark]: Toolchain (without parser) took 5847.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 949.5 MB in the beginning and 981.7 MB in the end (delta: -32.2 MB). Peak memory consumption was 288.2 MB. Max. memory is 11.5 GB. [2018-12-02 04:05:55,446 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:05:55,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 04:05:55,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:05:55,447 INFO L168 Benchmark]: Boogie Preprocessor took 16.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:05:55,447 INFO L168 Benchmark]: RCFGBuilder took 162.74 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:05:55,447 INFO L168 Benchmark]: BuchiAutomizer took 5380.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 981.7 MB in the end (delta: 118.3 MB). Peak memory consumption was 297.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:05:55,448 INFO L168 Benchmark]: Witness Printer took 2.81 ms. Allocated memory is still 1.3 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:05:55,450 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 162.74 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5380.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 981.7 MB in the end (delta: 118.3 MB). Peak memory consumption was 297.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 ms. Allocated memory is still 1.3 GB. Free memory is still 981.7 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * ps2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 103 SDtfs, 95 SDslu, 60 SDs, 0 SdLazy, 104 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax107 hnf99 lsp89 ukn85 mio100 lsp38 div100 bol100 ite100 ukn100 eq189 hnf88 smp95 dnf192 smp75 tf100 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...