./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/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 7e261b5f7bef15d0f506921c1007bbeeb414caf0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:57:59,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:57:59,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:57:59,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:57:59,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:57:59,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:57:59,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:57:59,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:57:59,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:57:59,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:57:59,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:57:59,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:57:59,978 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:57:59,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:57:59,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:57:59,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:57:59,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:57:59,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:57:59,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:57:59,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:57:59,987 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:57:59,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:57:59,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:57:59,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:57:59,990 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:57:59,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:57:59,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:57:59,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:57:59,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:57:59,995 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:57:59,995 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:57:59,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:57:59,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:57:59,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:57:59,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:57:59,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:57:59,997 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:58:00,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:58:00,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:58:00,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:58:00,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:58:00,011 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:58:00,011 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:58:00,011 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:58:00,011 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:58:00,011 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:58:00,012 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:58:00,012 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:58:00,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:58:00,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:58:00,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:58:00,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:58:00,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:58:00,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:58:00,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:58:00,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:58:00,013 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:58:00,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:58:00,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:58:00,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:58:00,015 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:58:00,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:58:00,015 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:58:00,015 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:58:00,015 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:58:00,016 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_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/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 -> 7e261b5f7bef15d0f506921c1007bbeeb414caf0 [2018-11-10 04:58:00,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:58:00,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:58:00,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:58:00,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:58:00,053 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:58:00,054 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca_true-termination.c.i [2018-11-10 04:58:00,088 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/data/bf9052846/d9832e20b338489d9a989f075f8c6ac6/FLAG78d7540ee [2018-11-10 04:58:00,516 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:58:00,516 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca_true-termination.c.i [2018-11-10 04:58:00,523 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/data/bf9052846/d9832e20b338489d9a989f075f8c6ac6/FLAG78d7540ee [2018-11-10 04:58:00,531 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/bin-2019/uautomizer/data/bf9052846/d9832e20b338489d9a989f075f8c6ac6 [2018-11-10 04:58:00,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:58:00,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:58:00,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:58:00,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:58:00,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:58:00,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dec51db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00, skipping insertion in model container [2018-11-10 04:58:00,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:58:00,571 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:58:00,752 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:58:00,759 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:58:00,787 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:58:00,809 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:58:00,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00 WrapperNode [2018-11-10 04:58:00,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:58:00,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:58:00,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:58:00,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:58:00,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:58:00,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:58:00,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:58:00,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:58:00,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... [2018-11-10 04:58:00,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:58:00,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:58:00,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:58:00,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:58:00,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/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-11-10 04:58:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:58:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:58:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:58:00,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:58:01,139 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:58:01,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:58:01 BoogieIcfgContainer [2018-11-10 04:58:01,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:58:01,140 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:58:01,140 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:58:01,144 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:58:01,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:58:01,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:58:00" (1/3) ... [2018-11-10 04:58:01,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4def5974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:58:01, skipping insertion in model container [2018-11-10 04:58:01,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:58:01,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:00" (2/3) ... [2018-11-10 04:58:01,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4def5974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:58:01, skipping insertion in model container [2018-11-10 04:58:01,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:58:01,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:58:01" (3/3) ... [2018-11-10 04:58:01,148 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-termination.c.i [2018-11-10 04:58:01,185 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:58:01,185 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:58:01,186 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:58:01,186 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:58:01,186 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:58:01,186 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:58:01,186 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:58:01,186 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:58:01,186 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:58:01,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 04:58:01,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:58:01,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:58:01,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:58:01,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:58:01,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:58:01,218 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:58:01,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 04:58:01,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:58:01,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:58:01,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:58:01,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:58:01,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:58:01,225 INFO L793 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L564true assume !(main_~length1~0 < 1); 17#L564-2true assume !(main_~length2~0 < 1); 5#L567-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 19#L572true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L572 21#L572-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L572-1 16#L573true assume { :begin_inline_cstrcspn } true;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~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~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_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 23#L552-3true [2018-11-10 04:58:01,225 INFO L795 eck$LassoCheckResult]: Loop: 23#L552-3true assume true; 18#L552-1true assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 11#L553true SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L553 14#L553-1true cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 15#L555-3true assume !true; 23#L552-3true [2018-11-10 04:58:01,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 04:58:01,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:01,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:01,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash 49778825, now seen corresponding path program 1 times [2018-11-10 04:58:01,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:01,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:01,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:58:01,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 04:58:01,366 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:58:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:58:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:58:01,378 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-10 04:58:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:58:01,383 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-10 04:58:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:58:01,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-10 04:58:01,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:58:01,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 20 transitions. [2018-11-10 04:58:01,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 04:58:01,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 04:58:01,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-10 04:58:01,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:58:01,390 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 04:58:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-10 04:58:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 04:58:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 04:58:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-10 04:58:01,411 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 04:58:01,411 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 04:58:01,411 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:58:01,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-10 04:58:01,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 04:58:01,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:58:01,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:58:01,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:58:01,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:58:01,413 INFO L793 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 58#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 59#L564 assume !(main_~length1~0 < 1); 60#L564-2 assume !(main_~length2~0 < 1); 52#L567-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 53#L572 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L572 66#L572-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L572-1 64#L573 assume { :begin_inline_cstrcspn } true;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~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~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_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 56#L552-3 [2018-11-10 04:58:01,413 INFO L795 eck$LassoCheckResult]: Loop: 56#L552-3 assume true; 65#L552-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 61#L553 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L553 62#L553-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 57#L555-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 50#L556 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L556 51#L556-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 54#L556-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset; 55#L555-1 assume !(cstrcspn_~sc~0 != 0); 56#L552-3 [2018-11-10 04:58:01,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 04:58:01,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1552498561, now seen corresponding path program 1 times [2018-11-10 04:58:01,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:01,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:01,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:58:01,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1454924651, now seen corresponding path program 1 times [2018-11-10 04:58:01,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:01,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:01,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:01,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:01,885 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 04:58:01,982 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:58:01,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:58:01,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:58:01,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:58:01,983 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:58:01,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:58:01,983 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:58:01,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:58:01,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 04:58:01,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:58:01,984 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:58:02,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,324 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-11-10 04:58:02,453 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 04:58:02,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:02,895 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:58:02,899 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:58:02,901 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-11-10 04:58:02,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,908 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-11-10 04:58:02,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,911 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-11-10 04:58:02,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,913 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-11-10 04:58:02,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,917 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-11-10 04:58:02,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:02,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:02,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,925 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-11-10 04:58:02,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,928 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-11-10 04:58:02,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,932 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-11-10 04:58:02,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,935 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-11-10 04:58:02,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:02,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,937 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-11-10 04:58:02,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:02,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:02,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,951 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-11-10 04:58:02,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:02,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:02,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,956 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-11-10 04:58:02,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:02,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:02,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:58:02,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,969 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:58:02,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,974 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:58:02,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:02,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:58:02,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:02,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,991 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:58:02,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:02,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:58:02,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:02,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:02,998 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-11-10 04:58:02,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:02,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:02,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:02,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:03,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:03,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:03,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:03,005 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-11-10 04:58:03,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:03,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:03,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:03,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:03,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:03,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:03,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:03,021 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-11-10 04:58:03,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:03,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:03,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:03,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:03,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:03,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:03,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:03,028 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-11-10 04:58:03,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:03,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:03,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:03,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:03,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:03,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:03,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:03,036 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-11-10 04:58:03,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:03,037 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:58:03,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:03,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:03,040 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:58:03,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:03,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:03,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:58:03,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:03,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:03,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:03,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:03,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:03,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:03,102 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:58:03,125 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:58:03,125 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:58:03,127 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:58:03,128 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:58:03,129 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:58:03,129 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrcspn_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-11-10 04:58:03,175 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 04:58:03,183 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:58:03,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:03,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:58:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:03,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:58:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:03,297 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 04:58:03,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 04:58:03,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 28 states and 33 transitions. Complement of second has 7 states. [2018-11-10 04:58:03,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:58:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:58:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 04:58:03,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 9 letters. [2018-11-10 04:58:03,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:58:03,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 17 letters. Loop has 9 letters. [2018-11-10 04:58:03,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:58:03,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 18 letters. [2018-11-10 04:58:03,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:58:03,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 04:58:03,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:58:03,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 28 transitions. [2018-11-10 04:58:03,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 04:58:03,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 04:58:03,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-10 04:58:03,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:58:03,392 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 04:58:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-10 04:58:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-10 04:58:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 04:58:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 04:58:03,393 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 04:58:03,393 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 04:58:03,393 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:58:03,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 04:58:03,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:58:03,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:58:03,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:58:03,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:58:03,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:58:03,395 INFO L793 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 252#L564 assume !(main_~length1~0 < 1); 253#L564-2 assume !(main_~length2~0 < 1); 242#L567-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 243#L572 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L572 260#L572-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L572-1 257#L573 assume { :begin_inline_cstrcspn } true;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~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~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_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 258#L552-3 assume true; 259#L552-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 254#L553 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L553 255#L553-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 248#L555-3 [2018-11-10 04:58:03,395 INFO L795 eck$LassoCheckResult]: Loop: 248#L555-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 238#L556 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L556 239#L556-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 244#L556-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset; 246#L555-1 assume !!(cstrcspn_~sc~0 != 0); 248#L555-3 [2018-11-10 04:58:03,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash -798495055, now seen corresponding path program 1 times [2018-11-10 04:58:03,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:03,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:03,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:03,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:03,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash 60153159, now seen corresponding path program 1 times [2018-11-10 04:58:03,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:03,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:03,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:03,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:03,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1454924649, now seen corresponding path program 1 times [2018-11-10 04:58:03,423 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:03,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:03,769 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 114 [2018-11-10 04:58:03,847 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:58:03,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:58:03,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:58:03,847 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:58:03,847 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:58:03,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:58:03,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:58:03,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:58:03,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 04:58:03,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:58:03,848 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:58:03,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:03,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:04,097 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-10 04:58:04,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-11-10 04:58:04,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-11-10 04:58:04,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-11-10 04:58:04,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-11-10 04:58:04,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-11-10 04:58:04,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:04,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-11-10 04:58:04,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:58:04,605 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:58:04,605 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:58:04,606 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-11-10 04:58:04,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:04,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:04,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:04,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,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-11-10 04:58:04,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:04,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:04,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:04,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,614 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-11-10 04:58:04,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:04,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:04,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:04,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,616 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-11-10 04:58:04,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:04,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:04,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:04,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,618 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-11-10 04:58:04,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:04,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:04,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,621 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-11-10 04:58:04,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:04,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:04,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:04,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,623 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-11-10 04:58:04,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:04,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:04,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,626 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-11-10 04:58:04,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:58:04,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:58:04,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:58:04,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,628 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-11-10 04:58:04,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:04,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:04,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,631 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-11-10 04:58:04,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:04,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:04,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,634 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-11-10 04:58:04,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,634 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 04:58:04,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,643 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-10 04:58:04,643 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 04:58:04,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,668 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-11-10 04:58:04,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:04,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:04,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,671 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-11-10 04:58:04,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,672 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:58:04,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,673 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:58:04,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:04,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:58:04,677 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-11-10 04:58:04,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:58:04,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:58:04,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:58:04,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:58:04,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:58:04,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:58:04,696 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:58:04,715 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:58:04,716 INFO L444 ModelExtractionUtils]: 61 out of 67 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:58:04,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:58:04,717 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:58:04,717 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:58:04,717 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~spanp~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrcspn_~spanp~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 04:58:04,773 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 04:58:04,774 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:58:04,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:58:04,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 04:58:04,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:04,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:58:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:04,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:58:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:04,851 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 04:58:04,851 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 04:58:04,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 55 states and 63 transitions. Complement of second has 9 states. [2018-11-10 04:58:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:58:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:58:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-10 04:58:04,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 04:58:04,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:58:04,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 04:58:04,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:58:04,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 04:58:04,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:58:04,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2018-11-10 04:58:04,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:58:04,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 38 states and 44 transitions. [2018-11-10 04:58:04,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 04:58:04,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 04:58:04,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2018-11-10 04:58:04,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:58:04,911 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-10 04:58:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2018-11-10 04:58:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2018-11-10 04:58:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 04:58:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-10 04:58:04,916 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 04:58:04,916 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 04:58:04,916 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:58:04,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-11-10 04:58:04,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:58:04,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:58:04,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:58:04,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:58:04,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:58:04,917 INFO L793 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 481#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 482#L564 assume !(main_~length1~0 < 1); 483#L564-2 assume !(main_~length2~0 < 1); 472#L567-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 473#L572 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L572 492#L572-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L572-1 489#L573 assume { :begin_inline_cstrcspn } true;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~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~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_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 490#L552-3 assume true; 493#L552-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 499#L553 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L553 487#L553-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 480#L555-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 500#L556 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L556 497#L556-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 498#L556-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset; 495#L555-1 assume !(cstrcspn_~sc~0 != 0); 494#L552-3 assume true; 491#L552-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 484#L553 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L553 485#L553-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 479#L555-3 [2018-11-10 04:58:04,918 INFO L795 eck$LassoCheckResult]: Loop: 479#L555-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 468#L556 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L556 469#L556-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 474#L556-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset; 476#L555-1 assume !!(cstrcspn_~sc~0 != 0); 479#L555-3 [2018-11-10 04:58:04,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1280815899, now seen corresponding path program 2 times [2018-11-10 04:58:04,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:04,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:04,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:04,938 INFO L82 PathProgramCache]: Analyzing trace with hash 60153159, now seen corresponding path program 2 times [2018-11-10 04:58:04,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:04,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:04,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:58:04,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:58:04,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:58:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1970539117, now seen corresponding path program 1 times [2018-11-10 04:58:04,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:58:04,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:58:04,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:04,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:58:04,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:58:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:05,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:58:05,023 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_580cb11d-eb8d-44fa-8cfb-3cdaef0b4d2c/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-11-10 04:58:05,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:58:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:05,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:58:05,087 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 04:58:05,088 INFO L477 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-11-10 04:58:05,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:58:05,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:58:05,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 04:58:05,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-10 04:58:37,885 WARN L179 SmtUtils]: Spent 8.56 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 04:59:01,923 WARN L179 SmtUtils]: Spent 12.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 04:59:22,133 WARN L179 SmtUtils]: Spent 9.35 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 04:59:22,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 04:59:22,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-10 04:59:22,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:59:22,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:59:22,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:59:22,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-10 04:59:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:59:22,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:59:22,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2018-11-10 04:59:22,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 04:59:22,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=327, Unknown=4, NotChecked=0, Total=380 [2018-11-10 04:59:22,218 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-10 04:59:40,922 WARN L179 SmtUtils]: Spent 18.42 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-11-10 04:59:59,163 WARN L179 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-11-10 05:00:19,122 WARN L179 SmtUtils]: Spent 19.94 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-11-10 05:00:42,868 WARN L179 SmtUtils]: Spent 23.69 s on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-11-10 05:00:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:00:42,984 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-10 05:00:42,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 05:00:42,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2018-11-10 05:00:42,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:00:42,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 57 states and 63 transitions. [2018-11-10 05:00:42,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 05:00:42,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 05:00:42,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2018-11-10 05:00:42,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:00:42,987 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 05:00:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2018-11-10 05:00:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2018-11-10 05:00:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 05:00:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-10 05:00:42,989 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-10 05:00:42,989 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-10 05:00:42,989 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:00:42,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 46 transitions. [2018-11-10 05:00:42,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:00:42,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:00:42,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:00:42,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:00:42,991 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:00:42,992 INFO L793 eck$LassoCheckResult]: Stem: 723#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 718#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 719#L564 assume !(main_~length1~0 < 1); 720#L564-2 assume !(main_~length2~0 < 1); 709#L567-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 710#L572 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L572 732#L572-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L572-1 728#L573 assume { :begin_inline_cstrcspn } true;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~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~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_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 729#L552-3 assume true; 730#L552-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 731#L553 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L553 726#L553-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 727#L555-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 707#L556 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L556 708#L556-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 712#L556-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset; 714#L555-1 assume !!(cstrcspn_~sc~0 != 0); 742#L555-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 740#L556 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L556 739#L556-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 736#L556-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset; 735#L555-1 assume !(cstrcspn_~sc~0 != 0); 733#L552-3 assume true; 734#L552-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 721#L553 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L553 722#L553-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 715#L555-3 [2018-11-10 05:00:42,992 INFO L795 eck$LassoCheckResult]: Loop: 715#L555-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 705#L556 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L556 706#L556-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 711#L556-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset; 713#L555-1 assume !!(cstrcspn_~sc~0 != 0); 715#L555-3 [2018-11-10 05:00:42,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:00:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 432424949, now seen corresponding path program 2 times [2018-11-10 05:00:42,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:00:42,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:00:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:00:42,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:00:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:00:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:00:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:00:43,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:00:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash 60153159, now seen corresponding path program 3 times [2018-11-10 05:00:43,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:00:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:00:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:00:43,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:00:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:00:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:00:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:00:43,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:00:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash -570266157, now seen corresponding path program 3 times [2018-11-10 05:00:43,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:00:43,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:00:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:00:43,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:00:43,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:00:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:00:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:00:43,571 WARN L179 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 172 [2018-11-10 05:00:43,678 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-10 05:00:43,680 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:00:43,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:00:43,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:00:43,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:00:43,680 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:00:43,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:00:43,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:00:43,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:00:43,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 05:00:43,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:00:43,680 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:00:43,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:43,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:43,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:43,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:43,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:43,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:43,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,053 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2018-11-10 05:00:44,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-11-10 05:00:44,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,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-11-10 05:00:44,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,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-11-10 05:00:44,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-11-10 05:00:44,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-11-10 05:00:44,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:00:44,305 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-10 05:00:44,687 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-10 05:00:44,779 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:00:44,780 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:00:44,780 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-11-10 05:00:44,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:00:44,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:00:44,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:00:44,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:00:44,782 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-11-10 05:00:44,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:00:44,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:00:44,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:00:44,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:00:44,784 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-11-10 05:00:44,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:00:44,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:00:44,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:00:44,786 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-11-10 05:00:44,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:00:44,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:00:44,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:00:44,788 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-11-10 05:00:44,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:00:44,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:00:44,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:00:44,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:00:44,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:00:44,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:00:44,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:00:44,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:00:44,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:00:44,793 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-11-10 05:00:44,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:00:44,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:00:44,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:00:44,796 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-11-10 05:00:44,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:00:44,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:00:44,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:00:44,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:00:44,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:00:44,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:00:44,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:00:44,853 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 05:00:44,854 INFO L444 ModelExtractionUtils]: 60 out of 67 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:00:44,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:00:44,855 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:00:44,855 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:00:44,855 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~spanp~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~spanp~0.base)_2) = -1*ULTIMATE.start_cstrcspn_~spanp~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~spanp~0.base)_2 Supporting invariants [] [2018-11-10 05:00:44,964 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-11-10 05:00:44,965 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:00:44,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:00:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:00:44,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:00:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:00:44,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:00:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:00:45,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:00:45,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:00:45,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 56 states and 63 transitions. Complement of second has 7 states. [2018-11-10 05:00:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:00:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:00:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-10 05:00:45,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-10 05:00:45,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:00:45,038 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:00:45,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:00:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:00:45,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:00:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:00:45,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:00:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:00:45,085 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:00:45,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:00:45,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 57 states and 64 transitions. Complement of second has 9 states. [2018-11-10 05:00:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 05:00:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:00:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-10 05:00:45,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-10 05:00:45,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:00:45,125 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:00:45,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:00:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:00:45,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:00:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:00:45,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:00:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:00:45,168 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:00:45,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 05:00:45,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 65 states and 73 transitions. Complement of second has 6 states. [2018-11-10 05:00:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:00:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:00:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-10 05:00:45,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-10 05:00:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:00:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 31 letters. Loop has 5 letters. [2018-11-10 05:00:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:00:45,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 26 letters. Loop has 10 letters. [2018-11-10 05:00:45,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:00:45,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2018-11-10 05:00:45,188 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:00:45,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2018-11-10 05:00:45,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:00:45,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:00:45,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:00:45,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:00:45,189 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:00:45,189 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:00:45,189 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:00:45,189 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:00:45,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:00:45,189 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:00:45,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:00:45,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:00:45 BoogieIcfgContainer [2018-11-10 05:00:45,193 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:00:45,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:00:45,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:00:45,194 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:00:45,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:58:01" (3/4) ... [2018-11-10 05:00:45,196 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:00:45,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:00:45,197 INFO L168 Benchmark]: Toolchain (without parser) took 164662.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 958.5 MB in the beginning and 1.2 GB in the end (delta: -199.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:00:45,197 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:00:45,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.51 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 931.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:00:45,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:00:45,198 INFO L168 Benchmark]: Boogie Preprocessor took 21.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:00:45,198 INFO L168 Benchmark]: RCFGBuilder took 236.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:00:45,199 INFO L168 Benchmark]: BuchiAutomizer took 164053.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:00:45,199 INFO L168 Benchmark]: Witness Printer took 2.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:00:45,201 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 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.51 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 931.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 931.6 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 164053.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.57 ms. Allocated memory is still 1.3 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 #Ultimate.alloc_#res - 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 * p + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * spanp + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One nondeterministic module has affine ranking function -1 * spanp + unknown-#length-unknown[spanp] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 164.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 82.5s. Construction of modules took 0.2s. Büchi inclusion checks took 81.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 141 SDtfs, 169 SDslu, 240 SDs, 0 SdLazy, 279 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax107 hnf99 lsp89 ukn104 mio100 lsp44 div100 bol100 ite100 ukn100 eq201 hnf85 smp96 dnf134 smp90 tf100 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...