./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/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 c10d45b5c95e322c3a9476f6a89ce233987fcc3d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:52:48,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:52:48,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:52:48,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:52:48,958 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:52:48,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:52:48,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:52:48,960 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:52:48,961 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:52:48,961 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:52:48,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:52:48,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:52:48,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:52:48,962 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:52:48,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:52:48,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:52:48,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:52:48,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:52:48,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:52:48,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:52:48,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:52:48,967 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:52:48,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:52:48,969 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:52:48,969 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:52:48,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:52:48,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:52:48,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:52:48,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:52:48,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:52:48,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:52:48,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:52:48,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:52:48,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:52:48,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:52:48,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:52:48,973 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 08:52:48,980 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:52:48,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:52:48,981 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:52:48,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:52:48,981 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:52:48,981 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 08:52:48,981 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 08:52:48,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 08:52:48,982 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 08:52:48,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 08:52:48,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:52:48,983 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 08:52:48,984 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 08:52:48,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_f3f793f3-d9b5-4286-963e-929c6fed943a/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 -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2018-12-08 08:52:49,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:52:49,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:52:49,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:52:49,009 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:52:49,010 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:52:49,010 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-12-08 08:52:49,045 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/data/f236eb4c1/282f713b609c46489626959de18e8730/FLAG24fa3e0c8 [2018-12-08 08:52:49,473 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:52:49,474 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-12-08 08:52:49,479 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/data/f236eb4c1/282f713b609c46489626959de18e8730/FLAG24fa3e0c8 [2018-12-08 08:52:49,488 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/data/f236eb4c1/282f713b609c46489626959de18e8730 [2018-12-08 08:52:49,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:52:49,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:52:49,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:52:49,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:52:49,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:52:49,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da7353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49, skipping insertion in model container [2018-12-08 08:52:49,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:52:49,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:52:49,658 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:52:49,665 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:52:49,728 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:52:49,748 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:52:49,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49 WrapperNode [2018-12-08 08:52:49,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:52:49,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:52:49,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:52:49,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:52:49,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:52:49,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:52:49,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:52:49,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:52:49,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... [2018-12-08 08:52:49,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:52:49,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:52:49,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:52:49,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:52:49,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:52:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:52:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 08:52:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 08:52:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:52:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:52:49,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:52:49,963 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:52:49,963 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 08:52:49,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:52:49 BoogieIcfgContainer [2018-12-08 08:52:49,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:52:49,963 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 08:52:49,964 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 08:52:49,966 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 08:52:49,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:52:49,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:52:49" (1/3) ... [2018-12-08 08:52:49,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dabeaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:52:49, skipping insertion in model container [2018-12-08 08:52:49,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:52:49,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:52:49" (2/3) ... [2018-12-08 08:52:49,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dabeaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:52:49, skipping insertion in model container [2018-12-08 08:52:49,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:52:49,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:52:49" (3/3) ... [2018-12-08 08:52:49,969 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-termination.c.i [2018-12-08 08:52:50,009 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:52:50,009 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 08:52:50,009 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 08:52:50,009 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 08:52:50,009 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:52:50,009 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:52:50,009 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 08:52:50,009 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:52:50,010 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 08:52:50,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 08:52:50,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 08:52:50,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:52:50,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:52:50,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:52:50,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:52:50,037 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 08:52:50,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 08:52:50,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 08:52:50,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:52:50,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:52:50,039 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:52:50,039 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:52:50,044 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L562true assume !(main_~length1~0 < 1); 14#L562-2true assume !(main_~length2~0 < 1); 6#L565-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 16#L553-4true [2018-12-08 08:52:50,044 INFO L796 eck$LassoCheckResult]: Loop: 16#L553-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 11#L552-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 13#L553-3true assume !true; 16#L553-4true [2018-12-08 08:52:50,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-08 08:52:50,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:50,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2018-12-08 08:52:50,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:50,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:52:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:52:50,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:52:50,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-08 08:52:50,164 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 08:52:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 08:52:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 08:52:50,173 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-08 08:52:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:52:50,177 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-08 08:52:50,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 08:52:50,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-08 08:52:50,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 08:52:50,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-12-08 08:52:50,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 08:52:50,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 08:52:50,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-08 08:52:50,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:52:50,182 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 08:52:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-08 08:52:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-08 08:52:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 08:52:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-08 08:52:50,198 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 08:52:50,198 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-08 08:52:50,198 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 08:52:50,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-08 08:52:50,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 08:52:50,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:52:50,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:52:50,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:52:50,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 08:52:50,199 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 39#L562 assume !(main_~length1~0 < 1); 45#L562-2 assume !(main_~length2~0 < 1); 40#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 41#L553-4 [2018-12-08 08:52:50,199 INFO L796 eck$LassoCheckResult]: Loop: 41#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 46#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 47#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 43#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 41#L553-4 [2018-12-08 08:52:50,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:50,200 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-08 08:52:50,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:50,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:50,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:50,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2018-12-08 08:52:50,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:50,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:50,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:52:50,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2018-12-08 08:52:50,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:50,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:50,498 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-12-08 08:52:50,554 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:52:50,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:52:50,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:52:50,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:52:50,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:52:50,556 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:52:50,556 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:52:50,556 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:52:50,556 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 08:52:50,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:52:50,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:52:50,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:50,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,098 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:52:51,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:52:51,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:51,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:51,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:51,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:51,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:51,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,124 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:52:51,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,126 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:52:51,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:51,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:51,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,143 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:52:51,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:52:51,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:51,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:51,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:51,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:51,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:51,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,160 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 08:52:51,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 08:52:51,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:51,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:51,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:51,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:51,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:51,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:51,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:51,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:51,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:51,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:51,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:52:51,202 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 08:52:51,202 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 08:52:51,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:52:51,205 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:52:51,205 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:52:51,206 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-12-08 08:52:51,228 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 08:52:51,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:52:51,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:52:51,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:52:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:52:51,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:52:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:52:51,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:52:51,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-08 08:52:51,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-12-08 08:52:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:52:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:52:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-08 08:52:51,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-08 08:52:51,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:52:51,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-08 08:52:51,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:52:51,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 08:52:51,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:52:51,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-08 08:52:51,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:52:51,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-12-08 08:52:51,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 08:52:51,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 08:52:51,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-08 08:52:51,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:52:51,346 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 08:52:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-08 08:52:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-08 08:52:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-08 08:52:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-12-08 08:52:51,348 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-08 08:52:51,348 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-12-08 08:52:51,348 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 08:52:51,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-12-08 08:52:51,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:52:51,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:52:51,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:52:51,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:52:51,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:52:51,349 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 153#L562 assume !(main_~length1~0 < 1); 162#L562-2 assume !(main_~length2~0 < 1); 154#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 155#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 163#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 165#L553-3 [2018-12-08 08:52:51,350 INFO L796 eck$LassoCheckResult]: Loop: 165#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 157#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 158#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 165#L553-3 [2018-12-08 08:52:51,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-08 08:52:51,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:51,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:51,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:51,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2018-12-08 08:52:51,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:51,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:51,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:51,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:51,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2018-12-08 08:52:51,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:51,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:51,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:51,646 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2018-12-08 08:52:51,711 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:52:51,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:52:51,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:52:51,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:52:51,712 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:52:51,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:52:51,712 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:52:51,712 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:52:51,712 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 08:52:51,712 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:52:51,712 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:52:51,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:51,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:52:52,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:52:52,154 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:52:52,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:52:52,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:52:52,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:52:52,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,181 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:52:52,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,183 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:52:52,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:52:52,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:52:52,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:52:52,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:52:52,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:52:52,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:52:52,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:52:52,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:52:52,215 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:52:52,221 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 08:52:52,221 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 08:52:52,222 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:52:52,222 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:52:52,223 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:52:52,223 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-12-08 08:52:52,259 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-08 08:52:52,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:52:52,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:52:52,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:52:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:52:52,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:52:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:52:52,314 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 08:52:52,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-12-08 08:52:52,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 31 states and 38 transitions. Complement of second has 6 states. [2018-12-08 08:52:52,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:52:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:52:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-08 08:52:52,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 08:52:52,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:52:52,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 08:52:52,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:52:52,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 08:52:52,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:52:52,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-08 08:52:52,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:52:52,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2018-12-08 08:52:52,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 08:52:52,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 08:52:52,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-12-08 08:52:52,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:52:52,346 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-12-08 08:52:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-12-08 08:52:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-08 08:52:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 08:52:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-08 08:52:52,347 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 08:52:52,347 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-08 08:52:52,347 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 08:52:52,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-08 08:52:52,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:52:52,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:52:52,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:52:52,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:52:52,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:52:52,349 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 308#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 309#L562 assume !(main_~length1~0 < 1); 318#L562-2 assume !(main_~length2~0 < 1); 310#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 311#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 319#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 320#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 315#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 316#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 322#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 321#L553-3 [2018-12-08 08:52:52,349 INFO L796 eck$LassoCheckResult]: Loop: 321#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 314#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 321#L553-3 [2018-12-08 08:52:52,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2018-12-08 08:52:52,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:52,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:52,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:52,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:52,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:52,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2018-12-08 08:52:52,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:52,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:52,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:52:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:52:52,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:52:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2018-12-08 08:52:52,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:52:52,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:52:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:52,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:52:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:52:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:52:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:52:52,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 08:52:52,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3f793f3-d9b5-4286-963e-929c6fed943a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 08:52:52,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:52:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:52:52,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:52:52,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-08 08:52:52,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 08:52:52,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:52:52,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-08 08:52:52,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-08 08:52:52,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 08:52:52,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:52:52,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:52:52,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 08:52:52,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-08 08:52:56,248 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 08:52:58,003 WARN L180 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-08 08:52:58,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-08 08:52:58,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 08:52:58,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:52:58,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:52:58,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:52:58,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-12-08 08:52:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:52:58,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:52:58,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-12-08 08:52:58,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:52:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-12-08 08:52:58,049 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-12-08 08:53:02,386 WARN L180 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-08 08:53:04,925 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-12-08 08:53:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:53:04,963 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-08 08:53:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:53:04,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-12-08 08:53:04,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:53:04,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-12-08 08:53:04,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 08:53:04,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 08:53:04,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-08 08:53:04,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:53:04,964 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-08 08:53:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-08 08:53:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-08 08:53:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 08:53:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-08 08:53:04,965 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-08 08:53:04,965 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-08 08:53:04,966 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 08:53:04,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-12-08 08:53:04,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:53:04,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:53:04,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:53:04,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:53:04,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:53:04,966 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 420#L562 assume !(main_~length1~0 < 1); 428#L562-2 assume !(main_~length2~0 < 1); 421#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 422#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 429#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 430#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 426#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 427#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 434#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 435#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 432#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 433#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 431#L553-3 [2018-12-08 08:53:04,967 INFO L796 eck$LassoCheckResult]: Loop: 431#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 424#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 425#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 431#L553-3 [2018-12-08 08:53:04,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:53:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2018-12-08 08:53:04,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:53:04,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:53:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:53:04,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:53:04,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:53:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:53:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:53:04,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:53:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2018-12-08 08:53:04,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:53:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:53:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:53:04,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:53:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:53:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:53:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:53:04,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:53:04,991 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2018-12-08 08:53:04,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:53:04,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:53:04,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:53:04,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:53:04,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:53:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:53:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:53:05,490 WARN L180 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 160 [2018-12-08 08:53:05,578 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:53:05,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:53:05,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:53:05,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:53:05,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:53:05,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:53:05,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:53:05,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:53:05,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-08 08:53:05,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:53:05,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:53:05,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,857 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-12-08 08:53:05,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:05,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:53:06,498 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-08 08:53:06,553 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:53:06,553 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:53:06,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:53:06,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:53:06,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:53:06,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,576 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:53:06,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,583 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:53:06,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:53:06,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:53:06,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:53:06,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:53:06,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:53:06,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:53:06,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:53:06,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:53:06,612 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:53:06,626 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:53:06,626 INFO L444 ModelExtractionUtils]: 43 out of 52 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 08:53:06,626 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:53:06,627 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:53:06,627 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:53:06,627 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-12-08 08:53:06,716 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-12-08 08:53:06,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:53:06,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:53:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:53:06,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:53:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:53:06,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:53:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:53:06,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:53:06,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 08:53:06,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2018-12-08 08:53:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:53:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:53:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-08 08:53:06,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 08:53:06,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:53:06,773 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:53:06,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:53:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:53:06,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:53:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:53:06,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:53:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:53:06,811 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:53:06,811 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 08:53:06,830 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2018-12-08 08:53:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:53:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:53:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-08 08:53:06,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 08:53:06,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:53:06,831 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:53:06,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:53:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:53:06,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:53:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:53:06,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:53:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:53:06,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 08:53:06,870 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-08 08:53:06,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2018-12-08 08:53:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:53:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:53:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-12-08 08:53:06,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 08:53:06,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:53:06,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-08 08:53:06,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:53:06,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 08:53:06,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:53:06,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-12-08 08:53:06,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:53:06,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-12-08 08:53:06,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 08:53:06,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 08:53:06,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 08:53:06,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:53:06,886 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:53:06,886 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:53:06,886 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:53:06,886 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 08:53:06,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:53:06,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:53:06,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 08:53:06,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:53:06 BoogieIcfgContainer [2018-12-08 08:53:06,890 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 08:53:06,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:53:06,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:53:06,890 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:53:06,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:52:49" (3/4) ... [2018-12-08 08:53:06,893 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:53:06,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:53:06,893 INFO L168 Benchmark]: Toolchain (without parser) took 17403.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -255.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:53:06,894 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:53:06,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 08:53:06,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:53:06,894 INFO L168 Benchmark]: Boogie Preprocessor took 17.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:53:06,895 INFO L168 Benchmark]: RCFGBuilder took 168.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-12-08 08:53:06,895 INFO L168 Benchmark]: BuchiAutomizer took 16926.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.6 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:53:06,895 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:53:06,897 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 168.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16926.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.6 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.5s. Construction of modules took 0.0s. Büchi inclusion checks took 7.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 82 SDslu, 73 SDs, 0 SdLazy, 118 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax108 hnf99 lsp89 ukn80 mio100 lsp43 div100 bol100 ite100 ukn100 eq188 hnf87 smp98 dnf226 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...