./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_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_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/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 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 07:03:00,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:03:00,909 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:03:00,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:03:00,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:03:00,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:03:00,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:03:00,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:03:00,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:03:00,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:03:00,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:03:00,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:03:00,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:03:00,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:03:00,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:03:00,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:03:00,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:03:00,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:03:00,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:03:00,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:03:00,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:03:00,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:03:00,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:03:00,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:03:00,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:03:00,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:03:00,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:03:00,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:03:00,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:03:00,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:03:00,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:03:00,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:03:00,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:03:00,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:03:00,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:03:00,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:03:00,930 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 07:03:00,938 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:03:00,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:03:00,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 07:03:00,939 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 07:03:00,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 07:03:00,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 07:03:00,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 07:03:00,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:03:00,940 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 07:03:00,941 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 07:03:00,941 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 07:03:00,941 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_e50c6dd5-08bf-4e13-bbb2-59329af793eb/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 -> 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b [2018-12-02 07:03:00,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:03:00,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:03:00,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:03:00,970 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:03:00,971 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:03:00,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-12-02 07:03:01,009 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/data/ad2712d79/5b3785511ad94ed59416f3e6aede3690/FLAG566bec564 [2018-12-02 07:03:01,451 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:03:01,451 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-12-02 07:03:01,456 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/data/ad2712d79/5b3785511ad94ed59416f3e6aede3690/FLAG566bec564 [2018-12-02 07:03:01,464 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/data/ad2712d79/5b3785511ad94ed59416f3e6aede3690 [2018-12-02 07:03:01,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:03:01,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:03:01,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:03:01,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:03:01,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:03:01,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115e7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01, skipping insertion in model container [2018-12-02 07:03:01,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:03:01,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:03:01,645 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:03:01,651 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:03:01,726 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:03:01,753 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:03:01,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01 WrapperNode [2018-12-02 07:03:01,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:03:01,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:03:01,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:03:01,754 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:03:01,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:03:01,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:03:01,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:03:01,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:03:01,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... [2018-12-02 07:03:01,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:03:01,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:03:01,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:03:01,798 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:03:01,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/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 07:03:01,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:03:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:03:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:03:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:03:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:03:01,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:03:01,979 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:03:01,979 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 07:03:01,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:03:01 BoogieIcfgContainer [2018-12-02 07:03:01,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:03:01,980 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 07:03:01,980 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 07:03:01,983 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 07:03:01,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:03:01,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 07:03:01" (1/3) ... [2018-12-02 07:03:01,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37634efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:03:01, skipping insertion in model container [2018-12-02 07:03:01,985 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:03:01,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:03:01" (2/3) ... [2018-12-02 07:03:01,986 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37634efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:03:01, skipping insertion in model container [2018-12-02 07:03:01,986 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:03:01,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:03:01" (3/3) ... [2018-12-02 07:03:01,987 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca_true-termination.c.i [2018-12-02 07:03:02,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:03:02,031 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 07:03:02,031 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 07:03:02,031 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 07:03:02,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:03:02,031 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:03:02,032 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 07:03:02,032 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:03:02,032 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 07:03:02,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 07:03:02,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 07:03:02,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:03:02,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:03:02,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 07:03:02,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:03:02,066 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 07:03:02,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 07:03:02,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 07:03:02,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:03:02,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:03:02,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 07:03:02,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:03:02,073 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-12-02 07:03:02,074 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-12-02 07:03:02,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 07:03:02,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:02,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:02,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-02 07:03:02,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:02,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:02,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:02,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:02,197 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 07:03:02,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:03:02,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 07:03:02,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 07:03:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 07:03:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 07:03:02,211 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-02 07:03:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:03:02,215 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 07:03:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 07:03:02,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 07:03:02,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 07:03:02,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-02 07:03:02,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 07:03:02,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 07:03:02,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-02 07:03:02,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:03:02,220 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 07:03:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-02 07:03:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 07:03:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 07:03:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 07:03:02,236 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 07:03:02,236 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 07:03:02,237 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 07:03:02,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 07:03:02,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 07:03:02,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:03:02,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:03:02,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 07:03:02,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:03:02,238 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2018-12-02 07:03:02,238 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-12-02 07:03:02,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 07:03:02,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:02,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:02,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:02,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-02 07:03:02,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:02,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:03:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-02 07:03:02,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:02,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:02,419 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-02 07:03:02,566 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-02 07:03:02,705 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-12-02 07:03:02,772 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:03:02,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:03:02,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:03:02,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:03:02,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:03:02,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:03:02,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:03:02,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:03:02,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 07:03:02,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:03:02,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:03:02,791 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 07:03:03,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 07:03:03,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 07:03:03,065 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 07:03:03,066 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 07:03:03,068 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 07:03:03,069 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 07:03:03,070 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 07:03:03,071 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 07:03:03,072 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 07:03:03,074 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 07:03:03,075 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 07:03:03,076 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 07:03:03,077 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 07:03:03,078 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 07:03:03,079 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 07:03:03,080 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 07:03:03,081 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 07:03:03,398 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-12-02 07:03:03,514 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:03:03,517 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:03:03,518 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 07:03:03,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:03,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:03,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:03,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:03,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:03,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:03,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:03,525 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 07:03:03,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:03,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:03,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:03,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:03,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:03,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:03,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:03,529 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 07:03:03,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:03,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:03,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:03,530 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-02 07:03:03,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:03,531 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:03:03,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:03,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:03,543 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 07:03:03,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:03,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:03,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:03,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:03,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:03,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:03,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:03,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:03,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:03:03,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:03,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:03,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:03,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:03,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:03,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:03,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:03,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:03:03,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:03,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:03,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:03,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:03,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:03,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:03,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:03:03,590 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:03:03,590 INFO L444 ModelExtractionUtils]: 49 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 07:03:03,592 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:03:03,592 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:03:03,593 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:03:03,593 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1 Supporting invariants [] [2018-12-02 07:03:03,614 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 07:03:03,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:03,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:03,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:03,658 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 07:03:03,660 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 07:03:03,661 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 07:03:03,684 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-02 07:03:03,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 07:03:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 07:03:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-02 07:03:03,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 07:03:03,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:03,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-02 07:03:03,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:03,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-02 07:03:03,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:03,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-02 07:03:03,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:03:03,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-02 07:03:03,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 07:03:03,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 07:03:03,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-02 07:03:03,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:03:03,689 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 07:03:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-02 07:03:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 07:03:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 07:03:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-02 07:03:03,690 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 07:03:03,690 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 07:03:03,690 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 07:03:03,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-02 07:03:03,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:03:03,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:03:03,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:03:03,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:03:03,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:03:03,691 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2018-12-02 07:03:03,692 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2018-12-02 07:03:03,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-02 07:03:03,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:03,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:03,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:03,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-02 07:03:03,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:03,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:03,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:03,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:03,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:03,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-02 07:03:03,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:03,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:03,988 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2018-12-02 07:03:04,059 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:03:04,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:03:04,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:03:04,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:03:04,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:03:04,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:03:04,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:03:04,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:03:04,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 07:03:04,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:03:04,059 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:03:04,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 07:03:04,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 07:03:04,066 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 07:03:04,066 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 07:03:04,271 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 07:03:04,272 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 07:03:04,272 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 07:03:04,274 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 07:03:04,275 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 07:03:04,276 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 07:03:04,276 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 07:03:04,277 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 07:03:04,278 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 07:03:04,279 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 07:03:04,280 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 07:03:04,280 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 07:03:04,281 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 07:03:04,282 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 07:03:04,656 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:03:04,656 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:03:04,657 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 07:03:04,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:04,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:04,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:04,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:04,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,658 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 07:03:04,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:04,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:04,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:04,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,661 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 07:03:04,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:04,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:04,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:04,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:04,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,663 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 07:03:04,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:04,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:04,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:04,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,666 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 07:03:04,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:04,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:04,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:04,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,672 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 07:03:04,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:04,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:04,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:04,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,675 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 07:03:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,675 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:03:04,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,677 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:03:04,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:04,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,683 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 07:03:04,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,684 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:03:04,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,686 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:03:04,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:04,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:04,690 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 07:03:04,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:04,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:04,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:04,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:04,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:04,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:04,701 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:03:04,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:03:04,709 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 07:03:04,709 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:03:04,710 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 07:03:04,710 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:03:04,710 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1 >= 0] [2018-12-02 07:03:04,744 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-12-02 07:03:04,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 07:03:04,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:04,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:04,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:04,802 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 07:03:04,802 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 07:03:04,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-02 07:03:04,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-02 07:03:04,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 07:03:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 07:03:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 07:03:04,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 07:03:04,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:04,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 07:03:04,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:04,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 07:03:04,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:04,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-02 07:03:04,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:03:04,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-02 07:03:04,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 07:03:04,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 07:03:04,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-02 07:03:04,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:03:04,847 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-02 07:03:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-02 07:03:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 07:03:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 07:03:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-02 07:03:04,849 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 07:03:04,849 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 07:03:04,849 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 07:03:04,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-02 07:03:04,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:03:04,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:03:04,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:03:04,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:03:04,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:03:04,851 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 365#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 366#L382 assume !(main_~length1~0 < 1); 367#L382-2 assume !(main_~length2~0 < 1); 364#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 360#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 361#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 374#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 370#L372-1 assume !cstrcspn_#t~short210; 371#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 356#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 357#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 358#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 359#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 363#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 373#L372-5 [2018-12-02 07:03:04,851 INFO L796 eck$LassoCheckResult]: Loop: 373#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 368#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 369#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 373#L372-5 [2018-12-02 07:03:04,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-02 07:03:04,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:04,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:04,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-02 07:03:04,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:04,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:04,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:04,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-12-02 07:03:04,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:04,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:03:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:03:04,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:03:04,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e50c6dd5-08bf-4e13-bbb2-59329af793eb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:03:04,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:04,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:04,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-02 07:03:04,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:03:04,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:03:04,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-02 07:03:04,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2018-12-02 07:03:04,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:03:05,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 07:03:05,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 07:03:05,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:03:05,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:03:05,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 07:03:05,034 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:27, output treesize:15 [2018-12-02 07:03:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:03:05,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:03:05,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-12-02 07:03:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 07:03:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:03:05,214 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-12-02 07:03:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:03:05,329 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-02 07:03:05,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:03:05,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-12-02 07:03:05,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:03:05,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-12-02 07:03:05,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 07:03:05,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 07:03:05,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-12-02 07:03:05,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:03:05,333 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-02 07:03:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-12-02 07:03:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-12-02 07:03:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 07:03:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-02 07:03:05,336 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 07:03:05,336 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 07:03:05,336 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 07:03:05,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-02 07:03:05,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 07:03:05,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:03:05,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:03:05,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:03:05,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 07:03:05,338 INFO L794 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 521#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 522#L382 assume !(main_~length1~0 < 1); 523#L382-2 assume !(main_~length2~0 < 1); 520#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 516#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 517#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 536#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 526#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 527#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 512#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 513#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 514#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 515#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 519#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 529#L372-5 [2018-12-02 07:03:05,338 INFO L796 eck$LassoCheckResult]: Loop: 529#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 524#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 525#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 529#L372-5 [2018-12-02 07:03:05,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-02 07:03:05,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:05,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:03:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:05,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-02 07:03:05,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:05,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:03:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:05,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-02 07:03:05,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:03:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:03:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:05,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:03:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:03:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:03:05,832 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 133 [2018-12-02 07:03:06,706 WARN L180 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-12-02 07:03:06,708 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:03:06,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:03:06,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:03:06,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:03:06,708 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:03:06,709 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:03:06,709 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:03:06,709 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:03:06,709 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 07:03:06,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:03:06,709 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:03:06,713 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 07:03:06,714 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 07:03:06,715 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 07:03:06,717 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 07:03:06,719 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 07:03:06,720 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 07:03:06,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:03:06,722 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 07:03:06,723 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 07:03:06,724 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 07:03:06,868 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 07:03:07,248 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-12-02 07:03:07,334 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 07:03:07,335 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 07:03:07,336 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 07:03:07,337 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 07:03:07,338 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 07:03:07,339 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 07:03:07,341 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 07:03:07,342 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 07:03:07,860 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-12-02 07:03:08,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:03:08,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:03:08,046 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 07:03:08,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:08,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:08,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:08,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,047 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 07:03:08,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:08,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:08,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:08,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,048 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 07:03:08,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:08,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:08,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:08,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,049 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 07:03:08,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,051 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 07:03:08,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:08,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:08,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:08,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,052 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 07:03:08,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:08,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:08,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:08,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,053 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 07:03:08,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:08,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:08,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:08,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,054 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 07:03:08,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,056 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 07:03:08,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:03:08,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:03:08,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:03:08,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:03:08,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,061 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 07:03:08,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,064 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 07:03:08,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:03:08,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,069 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 07:03:08,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,069 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-12-02 07:03:08,069 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-02 07:03:08,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,094 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2018-12-02 07:03:08,094 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-02 07:03:08,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,195 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 07:03:08,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,197 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 07:03:08,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,197 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:03:08,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,198 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:03:08,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,200 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 07:03:08,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,201 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:03:08,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,201 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:03:08,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:03:08,204 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 07:03:08,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:03:08,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:03:08,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:03:08,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:03:08,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:03:08,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:03:08,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:03:08,219 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 07:03:08,219 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 07:03:08,219 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:03:08,220 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:03:08,220 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:03:08,220 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-02 07:03:08,306 INFO L297 tatePredicateManager]: 26 out of 28 supporting invariants were superfluous and have been removed [2018-12-02 07:03:08,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 07:03:08,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:08,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:08,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:08,359 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 07:03:08,359 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 07:03:08,359 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 07:03:08,387 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-12-02 07:03:08,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 07:03:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 07:03:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 07:03:08,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 07:03:08,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:08,389 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:03:08,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:08,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:08,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:08,433 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 07:03:08,433 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 07:03:08,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 07:03:08,453 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-12-02 07:03:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 07:03:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 07:03:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 07:03:08,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 07:03:08,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:08,454 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 07:03:08,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:03:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:08,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:03:08,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:03:08,498 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 07:03:08,498 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 07:03:08,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 07:03:08,521 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2018-12-02 07:03:08,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 07:03:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 07:03:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 07:03:08,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 07:03:08,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:08,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 07:03:08,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:08,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 07:03:08,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:03:08,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-12-02 07:03:08,524 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:03:08,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-12-02 07:03:08,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 07:03:08,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 07:03:08,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 07:03:08,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:03:08,524 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:03:08,524 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:03:08,524 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:03:08,524 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 07:03:08,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:03:08,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:03:08,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 07:03:08,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 07:03:08 BoogieIcfgContainer [2018-12-02 07:03:08,528 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 07:03:08,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:03:08,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:03:08,529 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:03:08,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:03:01" (3/4) ... [2018-12-02 07:03:08,532 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 07:03:08,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:03:08,533 INFO L168 Benchmark]: Toolchain (without parser) took 7066.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 950.6 MB in the beginning and 948.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 201.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:03:08,534 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:03:08,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-02 07:03:08,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:03:08,534 INFO L168 Benchmark]: Boogie Preprocessor took 17.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:03:08,535 INFO L168 Benchmark]: RCFGBuilder took 181.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 07:03:08,535 INFO L168 Benchmark]: BuchiAutomizer took 6548.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 948.5 MB in the end (delta: 121.6 MB). Peak memory consumption was 212.9 MB. Max. memory is 11.5 GB. [2018-12-02 07:03:08,535 INFO L168 Benchmark]: Witness Printer took 3.63 ms. Allocated memory is still 1.2 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:03:08,537 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6548.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 948.5 MB in the end (delta: 121.6 MB). Peak memory consumption was 212.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.63 ms. Allocated memory is still 1.2 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + 2 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. 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 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 104 SDtfs, 169 SDslu, 103 SDs, 0 SdLazy, 142 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital365 mio100 ax100 hnf99 lsp93 ukn72 mio100 lsp40 div115 bol100 ite100 ukn100 eq183 hnf83 smp91 dnf870 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 126ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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...