./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_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_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/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 31b6f06b720558e9a2e510f7cce25403bea703ef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 07:51:10,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:51:10,943 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:51:10,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:51:10,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:51:10,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:51:10,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:51:10,952 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:51:10,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:51:10,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:51:10,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:51:10,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:51:10,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:51:10,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:51:10,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:51:10,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:51:10,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:51:10,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:51:10,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:51:10,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:51:10,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:51:10,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:51:10,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:51:10,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:51:10,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:51:10,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:51:10,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:51:10,966 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:51:10,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:51:10,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:51:10,968 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:51:10,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:51:10,968 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:51:10,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:51:10,969 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:51:10,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:51:10,970 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:51:10,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:51:10,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:51:10,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:51:10,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:51:10,981 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:51:10,981 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:51:10,981 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:51:10,981 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:51:10,981 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:51:10,981 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:51:10,982 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:51:10,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:51:10,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:51:10,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:51:10,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:51:10,982 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:51:10,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:51:10,982 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:51:10,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:51:10,983 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:51:10,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:51:10,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:51:10,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:51:10,983 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:51:10,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:51:10,983 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:51:10,984 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:51:10,984 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:51:10,984 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_44f5062e-12e6-481b-b90e-8fffa7a26cd1/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 -> 31b6f06b720558e9a2e510f7cce25403bea703ef [2018-11-10 07:51:11,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:51:11,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:51:11,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:51:11,018 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:51:11,019 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:51:11,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-11-10 07:51:11,054 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/data/3bae99b86/c325fa23c066496587ff90a74265544c/FLAGb85343099 [2018-11-10 07:51:11,493 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:51:11,494 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-11-10 07:51:11,500 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/data/3bae99b86/c325fa23c066496587ff90a74265544c/FLAGb85343099 [2018-11-10 07:51:11,510 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/bin-2019/uautomizer/data/3bae99b86/c325fa23c066496587ff90a74265544c [2018-11-10 07:51:11,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:51:11,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:51:11,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:11,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:51:11,517 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:51:11,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39819167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11, skipping insertion in model container [2018-11-10 07:51:11,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:51:11,551 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:51:11,736 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:11,742 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:51:11,772 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:11,807 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:51:11,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11 WrapperNode [2018-11-10 07:51:11,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:11,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:11,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:51:11,808 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:51:11,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:11,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:51:11,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:51:11,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:51:11,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... [2018-11-10 07:51:11,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:51:11,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:51:11,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:51:11,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:51:11,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f5062e-12e6-481b-b90e-8fffa7a26cd1/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 07:51:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:51:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:51:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:51:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:51:12,075 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:51:12,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:12 BoogieIcfgContainer [2018-11-10 07:51:12,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:51:12,076 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:51:12,076 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:51:12,078 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:51:12,078 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:51:12,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:51:11" (1/3) ... [2018-11-10 07:51:12,079 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fc9a316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:51:12, skipping insertion in model container [2018-11-10 07:51:12,079 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:51:12,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:11" (2/3) ... [2018-11-10 07:51:12,079 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fc9a316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:51:12, skipping insertion in model container [2018-11-10 07:51:12,079 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:51:12,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:12" (3/3) ... [2018-11-10 07:51:12,080 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca_true-termination.c.i [2018-11-10 07:51:12,110 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:51:12,111 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:51:12,111 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:51:12,111 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:51:12,111 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:51:12,111 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:51:12,111 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:51:12,111 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:51:12,111 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:51:12,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 07:51:12,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:51:12,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:12,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:12,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,141 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:51:12,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 07:51:12,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:51:12,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:12,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:12,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,150 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 10#L382true assume !(main_~length1~0 < 1); 14#L382-2true assume !(main_~length2~0 < 1); 7#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 27#L390true SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 13#L391true assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 4#L369-5true [2018-11-10 07:51:12,151 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 16#L369-1true SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 18#L369-2true assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 11#L371true SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 12#L371-1true cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 21#L372-9true assume !true; 22#L372-10true SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 3#L369-4true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 4#L369-5true [2018-11-10 07:51:12,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:12,155 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 07:51:12,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:12,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:12,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:12,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 07:51:12,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:12,271 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 07:51:12,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:51:12,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:51:12,277 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:51:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:51:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:51:12,290 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 07:51:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:51:12,295 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 07:51:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:51:12,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 07:51:12,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:51:12,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 07:51:12,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 07:51:12,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 07:51:12,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 07:51:12,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:51:12,304 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:51:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 07:51:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 07:51:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 07:51:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 07:51:12,323 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:51:12,323 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 07:51:12,323 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:51:12,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 07:51:12,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:51:12,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:12,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:12,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,325 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 75#L382 assume !(main_~length1~0 < 1); 76#L382-2 assume !(main_~length2~0 < 1); 72#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 73#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 82#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 68#L369-5 [2018-11-10 07:51:12,325 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 78#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 81#L372-3 assume !cstrpbrk_#t~short210; 64#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; 65#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 67#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 68#L369-5 [2018-11-10 07:51:12,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 07:51:12,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:12,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 07:51:12,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:12,589 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 07:51:12,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:51:12,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 07:51:12,590 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:51:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:51:12,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:51:12,591 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 07:51:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:51:12,812 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-10 07:51:12,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 07:51:12,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-10 07:51:12,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 07:51:12,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-11-10 07:51:12,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 07:51:12,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 07:51:12,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-10 07:51:12,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:51:12,816 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-10 07:51:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-10 07:51:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-10 07:51:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 07:51:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-10 07:51:12,819 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 07:51:12,819 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 07:51:12,819 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:51:12,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-10 07:51:12,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 07:51:12,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:12,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:12,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,821 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:12,821 INFO L793 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 160#L382 assume !(main_~length1~0 < 1); 161#L382-2 assume !(main_~length2~0 < 1); 156#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 157#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 169#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 167#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 152#L369-5 [2018-11-10 07:51:12,821 INFO L795 eck$LassoCheckResult]: Loop: 152#L369-5 assume true; 153#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 170#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 162#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 163#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 150#L372-9 assume true; 155#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 165#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 166#L372-3 assume cstrpbrk_#t~short210; 168#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 171#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 172#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; 158#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 154#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 151#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 152#L369-5 [2018-11-10 07:51:12,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-11-10 07:51:12,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:12,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:12,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:12,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-11-10 07:51:12,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:12,869 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-11-10 07:51:12,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:12,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:12,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:12,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:13,027 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-10 07:51:13,175 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-10 07:51:13,342 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2018-11-10 07:51:13,414 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:51:13,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:51:13,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:51:13,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:51:13,415 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:51:13,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:51:13,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:51:13,415 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:51:13,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 07:51:13,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:51:13,416 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:51:13,431 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 07:51:13,434 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 07:51:13,435 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 07:51:13,437 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 07:51:13,680 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-10 07:51:13,789 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 07:51:13,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,792 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 07:51:13,793 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 07:51:13,803 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 07:51:13,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:13,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:14,225 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:51:14,229 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:51:14,230 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 07:51:14,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:14,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:14,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:14,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:14,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:14,234 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 07:51:14,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:14,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:14,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:14,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:14,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:14,236 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 07:51:14,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:14,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:14,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:14,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:14,242 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 07:51:14,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:14,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:14,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:14,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:14,248 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 07:51:14,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,249 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:51:14,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,254 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:51:14,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:14,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:14,269 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 07:51:14,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:14,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:14,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:14,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:14,276 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 07:51:14,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:14,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:14,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:14,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:14,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:14,278 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 07:51:14,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:14,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:14,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:14,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:14,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:14,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:14,310 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:51:14,330 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:51:14,330 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:51:14,332 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:51:14,332 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:51:14,333 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:51:14,333 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-11-10 07:51:14,376 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 07:51:14,381 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:51:14,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:14,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:14,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:14,448 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 07:51:14,450 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 07:51:14,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 07:51:14,490 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 40 states and 47 transitions. Complement of second has 7 states. [2018-11-10 07:51:14,491 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 07:51:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:51:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 07:51:14,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-11-10 07:51:14,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:14,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-11-10 07:51:14,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:14,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-11-10 07:51:14,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:14,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-10 07:51:14,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 07:51:14,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-11-10 07:51:14,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 07:51:14,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 07:51:14,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-10 07:51:14,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:51:14,499 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-10 07:51:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-10 07:51:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 07:51:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 07:51:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-10 07:51:14,501 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 07:51:14,501 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 07:51:14,501 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:51:14,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-11-10 07:51:14,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:51:14,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:14,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:14,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:14,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:51:14,502 INFO L793 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 365#L382 assume !(main_~length1~0 < 1); 366#L382-2 assume !(main_~length2~0 < 1); 361#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 362#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 379#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 376#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 355#L369-5 assume true; 357#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 382#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 367#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 368#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 350#L372-9 [2018-11-10 07:51:14,502 INFO L795 eck$LassoCheckResult]: Loop: 350#L372-9 assume true; 359#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 371#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 374#L372-3 assume !cstrpbrk_#t~short210; 349#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset + 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 350#L372-9 [2018-11-10 07:51:14,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 07:51:14,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:14,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 07:51:14,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:14,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:14,547 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 07:51:14,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:51:14,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:51:14,548 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:51:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:51:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:51:14,548 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 07:51:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:51:14,556 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-10 07:51:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:51:14,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-10 07:51:14,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:51:14,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-11-10 07:51:14,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 07:51:14,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 07:51:14,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-10 07:51:14,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:51:14,559 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:51:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-10 07:51:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 07:51:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 07:51:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 07:51:14,561 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:51:14,561 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 07:51:14,561 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:51:14,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 07:51:14,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:51:14,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:14,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:14,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:14,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:14,562 INFO L793 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 444#L382 assume !(main_~length1~0 < 1); 445#L382-2 assume !(main_~length2~0 < 1); 441#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 442#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 458#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 455#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 435#L369-5 assume true; 437#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 459#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 447#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 448#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 429#L372-9 [2018-11-10 07:51:14,562 INFO L795 eck$LassoCheckResult]: Loop: 429#L372-9 assume true; 439#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 451#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 453#L372-3 assume cstrpbrk_#t~short210; 456#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 461#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 428#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset + 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 429#L372-9 [2018-11-10 07:51:14,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:14,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 07:51:14,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:14,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:14,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 07:51:14,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:14,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:14,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:14,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 07:51:14,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:14,898 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 109 [2018-11-10 07:51:14,984 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:51:14,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:51:14,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:51:14,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:51:14,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:51:14,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:51:14,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:51:14,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:51:14,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 07:51:14,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:51:14,985 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:51:14,990 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 07:51:15,216 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-11-10 07:51:15,310 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 07:51:15,311 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 07:51:15,312 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 07:51:15,314 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 07:51:15,315 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 07:51:15,316 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 07:51:15,317 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 07:51:15,318 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 07:51:15,319 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 07:51:15,320 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 07:51:15,321 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 07:51:15,322 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 07:51:15,323 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 07:51:15,324 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 07:51:15,325 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 07:51:15,325 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 07:51:15,326 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 07:51:15,327 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 07:51:15,328 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 07:51:15,329 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 07:51:15,746 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 07:51:15,800 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:51:15,800 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:51:15,800 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 07:51:15,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:15,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:15,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:15,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:15,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:15,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:15,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:15,806 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 07:51:15,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:15,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:15,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:15,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:15,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:15,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:15,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:15,810 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 07:51:15,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:15,810 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:51:15,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:15,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:15,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:51:15,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:15,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:15,819 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 07:51:15,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:15,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:15,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:15,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:15,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:15,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:15,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:15,823 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 07:51:15,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:15,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:15,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:15,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:15,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:15,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:15,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:51:15,871 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:51:15,871 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:51:15,872 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:51:15,872 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:51:15,873 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:51:15,873 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-10 07:51:15,927 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 07:51:15,929 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:51:15,929 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:51:15,929 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:51:15,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:15,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:15,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:15,980 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 07:51:15,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 07:51:15,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-10 07:51:16,042 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-11-10 07:51:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:51:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:51:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 07:51:16,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 07:51:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 07:51:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 07:51:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:16,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-11-10 07:51:16,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:51:16,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-11-10 07:51:16,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 07:51:16,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 07:51:16,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-11-10 07:51:16,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:51:16,047 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-10 07:51:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-11-10 07:51:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-10 07:51:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 07:51:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 07:51:16,049 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 07:51:16,050 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 07:51:16,050 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:51:16,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-11-10 07:51:16,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:51:16,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:51:16,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:51:16,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:16,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:16,051 INFO L793 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 726#L382 assume !(main_~length1~0 < 1); 727#L382-2 assume !(main_~length2~0 < 1); 723#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 724#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 740#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 737#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 714#L369-5 assume true; 715#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 745#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 730#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 731#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 720#L372-9 assume true; 722#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 733#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 736#L372-3 assume cstrpbrk_#t~short210; 739#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 742#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 710#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; 711#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 718#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 712#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 713#L369-5 assume true; 717#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 743#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 728#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 729#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 709#L372-9 [2018-11-10 07:51:16,051 INFO L795 eck$LassoCheckResult]: Loop: 709#L372-9 assume true; 719#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 732#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 735#L372-3 assume cstrpbrk_#t~short210; 738#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 741#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 708#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset + 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 709#L372-9 [2018-11-10 07:51:16,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-11-10 07:51:16,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:16,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:16,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:16,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 07:51:16,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:16,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:16,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:16,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:16,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:16,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 07:51:16,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:51:16,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:51:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:16,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:51:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:51:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:51:16,723 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 146 [2018-11-10 07:51:17,359 WARN L179 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 117 [2018-11-10 07:51:17,360 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:51:17,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:51:17,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:51:17,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:51:17,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:51:17,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:51:17,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:51:17,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:51:17,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 07:51:17,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:51:17,361 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:51:17,365 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 07:51:17,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:17,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:17,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:17,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:17,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:17,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:17,385 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 07:51:17,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:17,387 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 07:51:17,388 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 07:51:17,389 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 07:51:17,390 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 07:51:17,391 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 07:51:17,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 07:51:18,045 WARN L179 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2018-11-10 07:51:18,140 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 07:51:18,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:18,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:18,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:18,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:18,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:51:18,660 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-10 07:51:18,762 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 07:51:18,901 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:51:18,902 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:51:18,902 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 07:51:18,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,904 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 07:51:18,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,905 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 07:51:18,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,907 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 07:51:18,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:18,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:18,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,909 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 07:51:18,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,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 07:51:18,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,912 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 07:51:18,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,914 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 07:51:18,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,916 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 07:51:18,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,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 07:51:18,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:18,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:18,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,920 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 07:51:18,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,921 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 07:51:18,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,923 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 07:51:18,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:51:18,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:51:18,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:51:18,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,924 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 07:51:18,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:18,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:18,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,927 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 07:51:18,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:18,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:18,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:18,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:18,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:18,931 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 07:51:18,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:18,933 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-10 07:51:18,933 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-11-10 07:51:18,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:18,968 INFO L402 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2018-11-10 07:51:18,968 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-11-10 07:51:19,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:19,114 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 07:51:19,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:19,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:19,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:19,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:19,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:19,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:19,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:19,119 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 07:51:19,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:19,119 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:51:19,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:19,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:19,120 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:51:19,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:19,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:19,128 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 07:51:19,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:19,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:19,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:19,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:19,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:19,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:19,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:19,131 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 07:51:19,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:19,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:19,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:19,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:19,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:19,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:19,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:19,134 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 07:51:19,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:19,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:19,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:19,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:19,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:19,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:19,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:51:19,136 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 07:51:19,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:51:19,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:51:19,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:51:19,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:51:19,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:51:19,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:51:19,151 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:51:19,161 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:51:19,161 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:51:19,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:51:19,162 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:51:19,162 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:51:19,162 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-10 07:51:19,286 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-10 07:51:19,288 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:51:19,288 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:51:19,288 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:51:19,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:19,390 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 07:51:19,391 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 07:51:19,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 07:51:19,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 07:51:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:51:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:51:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 07:51:19,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 07:51:19,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:19,460 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:51:19,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:19,544 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 07:51:19,545 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 07:51:19,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 07:51:19,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 07:51:19,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:51:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:51:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 07:51:19,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 07:51:19,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:19,606 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 07:51:19,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:19,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:19,657 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 07:51:19,657 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 07:51:19,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 07:51:19,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-11-10 07:51:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:51:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 07:51:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-10 07:51:19,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 07:51:19,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:19,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 07:51:19,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:19,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 07:51:19,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:51:19,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 07:51:19,707 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:51:19,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-11-10 07:51:19,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:51:19,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:51:19,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:51:19,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:51:19,708 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:51:19,708 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:51:19,708 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:51:19,708 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:51:19,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:51:19,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:51:19,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:51:19,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:51:19 BoogieIcfgContainer [2018-11-10 07:51:19,712 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:51:19,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:51:19,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:51:19,712 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:51:19,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:12" (3/4) ... [2018-11-10 07:51:19,715 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:51:19,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:51:19,715 INFO L168 Benchmark]: Toolchain (without parser) took 8202.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 955.8 MB in the beginning and 963.0 MB in the end (delta: -7.2 MB). Peak memory consumption was 336.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:19,716 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:51:19,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.13 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 928.8 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:19,716 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 928.8 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:19,717 INFO L168 Benchmark]: Boogie Preprocessor took 14.76 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 07:51:19,717 INFO L168 Benchmark]: RCFGBuilder took 183.84 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:19,718 INFO L168 Benchmark]: BuchiAutomizer took 7636.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 963.0 MB in the end (delta: 120.7 MB). Peak memory consumption was 350.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:19,718 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.4 GB. Free memory is still 963.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:51:19,721 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.13 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 928.8 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 928.8 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.76 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 183.84 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7636.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 229.6 MB). Free memory was 1.1 GB in the beginning and 963.0 MB in the end (delta: 120.7 MB). Peak memory consumption was 350.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.4 GB. Free memory is still 963.0 MB. 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 - 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 188 SDtfs, 267 SDslu, 230 SDs, 0 SdLazy, 214 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital379 mio100 ax100 hnf99 lsp91 ukn85 mio100 lsp30 div122 bol100 ite100 ukn100 eq172 hnf82 smp91 dnf606 smp32 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 183ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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...