./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_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_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/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 fcd11173df80f9a00fde2714abfd2a4ff8d40757 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:19:11,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:19:11,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:19:11,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:19:11,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:19:11,018 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:19:11,019 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:19:11,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:19:11,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:19:11,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:19:11,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:19:11,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:19:11,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:19:11,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:19:11,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:19:11,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:19:11,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:19:11,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:19:11,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:19:11,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:19:11,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:19:11,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:19:11,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:19:11,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:19:11,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:19:11,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:19:11,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:19:11,030 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:19:11,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:19:11,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:19:11,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:19:11,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:19:11,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:19:11,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:19:11,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:19:11,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:19:11,033 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 15:19:11,040 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:19:11,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:19:11,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:19:11,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:19:11,041 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:19:11,042 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 15:19:11,042 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 15:19:11,042 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 15:19:11,042 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 15:19:11,042 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 15:19:11,042 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 15:19:11,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:19:11,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:19:11,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:19:11,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 15:19:11,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:19:11,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:19:11,044 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 15:19:11,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:19:11,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:19:11,044 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 15:19:11,045 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 15:19:11,045 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_f28c6f12-11d4-4264-a701-a44d47d57f97/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 -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2018-12-02 15:19:11,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:19:11,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:19:11,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:19:11,071 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:19:11,071 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:19:11,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-12-02 15:19:11,106 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/data/1e5f72dd6/a740d0e0f7ba4023b58248ae795f897e/FLAG8fc284996 [2018-12-02 15:19:11,547 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:19:11,548 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-12-02 15:19:11,552 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/data/1e5f72dd6/a740d0e0f7ba4023b58248ae795f897e/FLAG8fc284996 [2018-12-02 15:19:11,560 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/bin-2019/uautomizer/data/1e5f72dd6/a740d0e0f7ba4023b58248ae795f897e [2018-12-02 15:19:11,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:19:11,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:19:11,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:19:11,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:19:11,565 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:19:11,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3629c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11, skipping insertion in model container [2018-12-02 15:19:11,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:19:11,588 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:19:11,741 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:19:11,749 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:19:11,824 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:19:11,853 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:19:11,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11 WrapperNode [2018-12-02 15:19:11,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:19:11,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:19:11,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:19:11,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:19:11,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:19:11,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:19:11,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:19:11,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:19:11,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... [2018-12-02 15:19:11,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:19:11,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:19:11,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:19:11,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:19:11,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/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 15:19:11,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:19:11,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:19:11,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:19:11,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:19:11,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:19:11,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:19:12,076 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:19:12,076 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 15:19:12,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:19:12 BoogieIcfgContainer [2018-12-02 15:19:12,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:19:12,077 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 15:19:12,077 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 15:19:12,079 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 15:19:12,080 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:19:12,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:19:11" (1/3) ... [2018-12-02 15:19:12,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@468d6abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:19:12, skipping insertion in model container [2018-12-02 15:19:12,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:19:12,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:19:11" (2/3) ... [2018-12-02 15:19:12,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@468d6abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:19:12, skipping insertion in model container [2018-12-02 15:19:12,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:19:12,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:19:12" (3/3) ... [2018-12-02 15:19:12,083 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca_true-termination.c.i [2018-12-02 15:19:12,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:19:12,127 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 15:19:12,127 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 15:19:12,127 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 15:19:12,127 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:19:12,127 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:19:12,127 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 15:19:12,127 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:19:12,127 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 15:19:12,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 15:19:12,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:19:12,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:19:12,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:19:12,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:19:12,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 15:19:12,158 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 15:19:12,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 15:19:12,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:19:12,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:19:12,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:19:12,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:19:12,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 15:19:12,167 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 11#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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 15:19:12,167 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 !!(49 != 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-12-02 15:19:12,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 15:19:12,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-02 15:19:12,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:12,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:12,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:12,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:12,280 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 15:19:12,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:19:12,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:19:12,284 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:19:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 15:19:12,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 15:19:12,294 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-02 15:19:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:19:12,298 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 15:19:12,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 15:19:12,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 15:19:12,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:19:12,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-02 15:19:12,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 15:19:12,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 15:19:12,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-02 15:19:12,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:19:12,303 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 15:19:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-02 15:19:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 15:19:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 15:19:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 15:19:12,319 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 15:19:12,319 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 15:19:12,319 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 15:19:12,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 15:19:12,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:19:12,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:19:12,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:19:12,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:19:12,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:19:12,320 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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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 15:19:12,320 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 !!(49 != 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 := 49 != 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-12-02 15:19:12,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 15:19:12,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:12,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-02 15:19:12,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:12,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:19:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-02 15:19:12,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:12,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:12,509 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-02 15:19:12,648 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-02 15:19:12,795 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-12-02 15:19:12,862 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:19:12,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:19:12,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:19:12,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:19:12,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:19:12,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:19:12,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:19:12,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:19:12,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 15:19:12,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:19:12,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:19:12,878 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 15:19:12,882 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 15:19:12,884 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 15:19:13,142 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 15:19:13,143 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 15:19:13,144 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 15:19:13,145 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 15:19:13,146 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 15:19:13,147 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 15:19:13,148 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 15:19:13,151 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 15:19:13,152 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 15:19:13,153 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 15:19:13,154 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 15:19:13,155 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 15:19:13,156 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 15:19:13,157 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 15:19:13,158 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 15:19:13,513 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-12-02 15:19:13,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:19:13,603 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:19:13,604 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 15:19:13,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:13,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:13,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:13,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:13,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:13,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:13,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:13,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:13,608 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 15:19:13,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:13,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:13,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:13,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:13,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:13,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:13,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:13,612 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 15:19:13,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:13,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:13,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:13,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:13,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:13,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:13,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:19:13,647 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:19:13,647 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 15:19:13,649 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:19:13,649 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 15:19:13,650 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:19:13,650 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-12-02 15:19:13,673 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 15:19:13,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 15:19:13,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:13,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:13,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:13,733 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 15:19:13,734 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 15:19:13,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 15:19:13,774 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 15:19:13,774 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 15:19:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 15:19:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-02 15:19:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 15:19:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-02 15:19:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-02 15:19:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:13,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-02 15:19:13,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:19:13,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-02 15:19:13,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 15:19:13,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 15:19:13,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-02 15:19:13,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:19:13,779 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 15:19:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-02 15:19:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 15:19:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 15:19:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-02 15:19:13,780 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 15:19:13,780 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 15:19:13,780 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 15:19:13,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-02 15:19:13,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:19:13,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:19:13,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:19:13,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:19:13,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 15:19:13,781 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#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; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; 182#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 184#L369-1 assume !!(49 != 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; 194#L372-5 [2018-12-02 15:19:13,781 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 189#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); 190#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, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 194#L372-5 [2018-12-02 15:19:13,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-02 15:19:13,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:13,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:13,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:13,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:13,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:13,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-02 15:19:13,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:13,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:13,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:13,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-02 15:19:13,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:13,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:13,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:13,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:14,091 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2018-12-02 15:19:14,160 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:19:14,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:19:14,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:19:14,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:19:14,160 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:19:14,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:19:14,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:19:14,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:19:14,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 15:19:14,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:19:14,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:19:14,164 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 15:19:14,165 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 15:19:14,167 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 15:19:14,168 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 15:19:14,169 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 15:19:14,170 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 15:19:14,172 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 15:19:14,175 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 15:19:14,347 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-12-02 15:19:14,412 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 15:19:14,413 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 15:19:14,414 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 15:19:14,415 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 15:19:14,416 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 15:19:14,416 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 15:19:14,417 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 15:19:14,418 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 15:19:14,419 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 15:19:14,420 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 15:19:14,422 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 15:19:14,826 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-02 15:19:14,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:19:14,838 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:19:14,839 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 15:19:14,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:14,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:14,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:14,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:14,841 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 15:19:14,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:14,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:14,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:14,845 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 15:19:14,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:14,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:14,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:14,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:14,847 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 15:19:14,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:14,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:14,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:14,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:14,849 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 15:19:14,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:14,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:14,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:14,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:14,851 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 15:19:14,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:14,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:14,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:14,854 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 15:19:14,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:14,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:14,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:14,858 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 15:19:14,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:14,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:14,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:14,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:14,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:14,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:14,888 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:19:14,904 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 15:19:14,905 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 15:19:14,905 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:19:14,906 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 15:19:14,906 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:19:14,906 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-02 15:19:14,943 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-02 15:19:14,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 15:19:14,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:14,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:14,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:14,995 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 15:19:14,995 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 15:19:14,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-02 15:19:15,023 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 15:19:15,024 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 15:19:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:19:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 15:19:15,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 15:19:15,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:15,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 15:19:15,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:15,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 15:19:15,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:15,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-02 15:19:15,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:19:15,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-02 15:19:15,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 15:19:15,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 15:19:15,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-02 15:19:15,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:19:15,028 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-02 15:19:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-02 15:19:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 15:19:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 15:19:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-02 15:19:15,030 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 15:19:15,030 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 15:19:15,030 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 15:19:15,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-02 15:19:15,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:19:15,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:19:15,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:19:15,031 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:19:15,031 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 15:19:15,031 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#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; 376#L382 assume !(main_~length1~0 < 1); 377#L382-2 assume !(main_~length2~0 < 1); 374#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; 370#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 371#L369-1 assume !!(49 != 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; 384#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 380#L372-1 assume !cstrcspn_#t~short210; 381#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 366#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 367#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 368#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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 369#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 373#L369-1 assume !!(49 != 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; 383#L372-5 [2018-12-02 15:19:15,032 INFO L796 eck$LassoCheckResult]: Loop: 383#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 378#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); 379#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, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 383#L372-5 [2018-12-02 15:19:15,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-02 15:19:15,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:15,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:15,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:15,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-02 15:19:15,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:15,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:15,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:15,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:15,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-12-02 15:19:15,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:15,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:15,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:15,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:19:15,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:15,162 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 15:19:15,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:19:15,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f28c6f12-11d4-4264-a701-a44d47d57f97/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 15:19:15,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:15,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:15,201 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 36 treesize of output 26 [2018-12-02 15:19:15,203 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 11 treesize of output 10 [2018-12-02 15:19:15,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:19:15,218 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 25 treesize of output 37 [2018-12-02 15:19:15,221 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 26 treesize of output 25 [2018-12-02 15:19:15,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:19:15,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:19:15,234 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 15:19:15,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 15:19:15,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-02 15:19:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:19:23,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:19:23,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-12-02 15:19:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:19:23,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2018-12-02 15:19:23,852 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-12-02 15:19:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:19:23,965 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-02 15:19:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:19:23,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-12-02 15:19:23,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:19:23,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-12-02 15:19:23,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 15:19:23,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 15:19:23,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-12-02 15:19:23,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:19:23,968 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-02 15:19:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-12-02 15:19:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-12-02 15:19:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 15:19:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-02 15:19:23,970 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 15:19:23,970 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-02 15:19:23,970 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 15:19:23,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-02 15:19:23,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:19:23,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:19:23,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:19:23,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:19:23,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 15:19:23,971 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 531#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; 532#L382 assume !(main_~length1~0 < 1); 533#L382-2 assume !(main_~length2~0 < 1); 530#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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 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; 526#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 527#L369-1 assume !!(49 != 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; 546#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 536#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); 537#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 522#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 523#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 524#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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 525#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 529#L369-1 assume !!(49 != 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; 539#L372-5 [2018-12-02 15:19:23,971 INFO L796 eck$LassoCheckResult]: Loop: 539#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 534#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); 535#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, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 539#L372-5 [2018-12-02 15:19:23,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-02 15:19:23,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:23,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:23,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:23,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:19:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:23,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-02 15:19:23,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:23,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:23,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:19:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:23,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-02 15:19:23,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:19:23,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:19:23,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:23,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:19:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:19:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:19:24,485 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 139 [2018-12-02 15:19:25,330 WARN L180 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2018-12-02 15:19:25,332 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:19:25,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:19:25,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:19:25,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:19:25,332 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:19:25,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:19:25,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:19:25,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:19:25,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 15:19:25,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:19:25,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:19:25,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 15:19:25,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 15:19:25,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 15:19:25,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 15:19:25,343 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 15:19:25,344 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 15:19:25,345 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 15:19:25,346 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 15:19:25,348 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 15:19:25,348 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 15:19:25,350 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 15:19:25,350 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 15:19:25,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:19:25,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:19:25,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:19:25,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:19:25,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:19:25,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:19:25,608 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 15:19:26,042 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-12-02 15:19:27,188 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-12-02 15:19:27,339 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-02 15:19:27,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:19:27,342 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:19:27,342 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 15:19:27,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,344 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 15:19:27,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,346 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 15:19:27,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,347 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 15:19:27,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:27,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:27,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,350 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 15:19:27,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,351 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 15:19:27,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,353 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 15:19:27,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,354 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 15:19:27,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:27,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:27,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,356 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 15:19:27,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,358 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 15:19:27,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,359 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 15:19:27,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,361 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 15:19:27,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,362 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 15:19:27,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,363 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 15:19:27,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,365 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 15:19:27,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,366 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 15:19:27,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,367 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 15:19:27,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:19:27,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:19:27,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:19:27,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,368 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 15:19:27,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:27,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:27,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,372 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 15:19:27,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:27,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:27,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:19:27,374 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 15:19:27,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:19:27,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:19:27,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:19:27,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:19:27,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:19:27,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:19:27,390 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:19:27,399 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 15:19:27,399 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 15:19:27,400 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:19:27,400 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 15:19:27,400 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:19:27,400 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 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-02 15:19:27,480 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-12-02 15:19:27,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 15:19:27,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:27,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:27,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:27,528 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 15:19:27,529 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 15:19:27,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 15:19:27,551 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 15:19:27,551 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 15:19:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:19:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 15:19:27,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 15:19:27,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:27,552 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:19:27,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:27,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:27,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:27,595 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 15:19:27,596 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 15:19:27,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 15:19:27,616 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 15:19:27,617 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 15:19:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:19:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 15:19:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 15:19:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:27,617 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:19:27,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:19:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:27,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:19:27,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:19:27,659 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 15:19:27,660 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 15:19:27,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 15:19:27,683 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 15:19:27,683 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 15:19:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:19:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 15:19:27,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 15:19:27,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:27,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 15:19:27,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:27,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 15:19:27,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:19:27,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-12-02 15:19:27,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:19:27,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-12-02 15:19:27,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 15:19:27,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 15:19:27,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 15:19:27,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:19:27,686 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:19:27,686 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:19:27,686 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:19:27,686 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 15:19:27,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:19:27,686 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:19:27,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 15:19:27,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:19:27 BoogieIcfgContainer [2018-12-02 15:19:27,690 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 15:19:27,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:19:27,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:19:27,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:19:27,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:19:12" (3/4) ... [2018-12-02 15:19:27,693 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 15:19:27,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:19:27,694 INFO L168 Benchmark]: Toolchain (without parser) took 16131.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.3 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -270.7 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:19:27,694 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:19:27,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 15:19:27,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:19:27,695 INFO L168 Benchmark]: Boogie Preprocessor took 15.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:19:27,695 INFO L168 Benchmark]: RCFGBuilder took 180.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-12-02 15:19:27,695 INFO L168 Benchmark]: BuchiAutomizer took 15613.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.2 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:19:27,696 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:19:27,698 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 180.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15613.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.2 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 -1 * sc1 + unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * 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 15.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.9s. 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: 102 SDtfs, 144 SDslu, 98 SDs, 0 SdLazy, 153 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp33 div134 bol100 ite100 ukn100 eq167 hnf77 smp88 dnf1057 smp33 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...