./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fcd11173df80f9a00fde2714abfd2a4ff8d40757 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 16:15:59,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:15:59,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:15:59,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:15:59,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:15:59,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:15:59,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:15:59,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:15:59,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:15:59,263 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:15:59,264 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:15:59,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:15:59,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:15:59,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:15:59,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:15:59,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:15:59,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:15:59,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:15:59,269 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:15:59,270 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:15:59,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:15:59,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:15:59,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:15:59,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:15:59,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:15:59,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:15:59,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:15:59,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:15:59,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:15:59,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:15:59,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:15:59,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:15:59,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:15:59,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:15:59,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:15:59,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:15:59,278 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 16:15:59,288 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:15:59,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:15:59,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 16:15:59,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 16:15:59,289 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 16:15:59,289 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 16:15:59,289 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 16:15:59,289 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 16:15:59,289 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 16:15:59,290 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 16:15:59,290 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 16:15:59,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:15:59,290 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 16:15:59,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:15:59,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:15:59,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 16:15:59,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 16:15:59,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 16:15:59,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:15:59,291 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 16:15:59,291 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 16:15:59,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 16:15:59,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:15:59,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:15:59,292 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 16:15:59,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:15:59,292 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 16:15:59,292 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 16:15:59,293 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 16:15:59,293 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_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2018-12-08 16:15:59,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:15:59,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:15:59,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:15:59,329 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:15:59,329 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:15:59,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-12-08 16:15:59,374 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/data/1fc9fea86/fd5b7e4bdbcf4f63a30b04b986f217ac/FLAGc55d007d7 [2018-12-08 16:15:59,810 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:15:59,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-12-08 16:15:59,815 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/data/1fc9fea86/fd5b7e4bdbcf4f63a30b04b986f217ac/FLAGc55d007d7 [2018-12-08 16:15:59,823 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/bin-2019/uautomizer/data/1fc9fea86/fd5b7e4bdbcf4f63a30b04b986f217ac [2018-12-08 16:15:59,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:15:59,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:15:59,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:15:59,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:15:59,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:15:59,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:15:59" (1/1) ... [2018-12-08 16:15:59,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6ee20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:15:59, skipping insertion in model container [2018-12-08 16:15:59,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:15:59" (1/1) ... [2018-12-08 16:15:59,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:15:59,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:16:00,009 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:16:00,015 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:16:00,077 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:16:00,104 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:16:00,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00 WrapperNode [2018-12-08 16:16:00,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:16:00,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:16:00,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:16:00,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:16:00,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:16:00,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:16:00,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:16:00,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:16:00,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... [2018-12-08 16:16:00,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:16:00,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:16:00,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:16:00,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:16:00,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/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 16:16:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:16:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 16:16:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 16:16:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:16:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:16:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:16:00,346 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:16:00,346 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 16:16:00,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:16:00 BoogieIcfgContainer [2018-12-08 16:16:00,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:16:00,347 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 16:16:00,347 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 16:16:00,350 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 16:16:00,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:16:00,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 04:15:59" (1/3) ... [2018-12-08 16:16:00,352 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28d60deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 04:16:00, skipping insertion in model container [2018-12-08 16:16:00,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:16:00,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:16:00" (2/3) ... [2018-12-08 16:16:00,353 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28d60deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 04:16:00, skipping insertion in model container [2018-12-08 16:16:00,353 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:16:00,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:16:00" (3/3) ... [2018-12-08 16:16:00,354 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca_true-termination.c.i [2018-12-08 16:16:00,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 16:16:00,399 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 16:16:00,399 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 16:16:00,399 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 16:16:00,399 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:16:00,399 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:16:00,399 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 16:16:00,399 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:16:00,399 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 16:16:00,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 16:16:00,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 16:16:00,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:00,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:00,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 16:16:00,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 16:16:00,430 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 16:16:00,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 16:16:00,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 16:16:00,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:00,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:00,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 16:16:00,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 16:16:00,438 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-12-08 16:16:00,439 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-12-08 16:16:00,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-08 16:16:00,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-08 16:16:00,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:00,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:00,556 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 16:16:00,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:16:00,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:16:00,559 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 16:16:00,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 16:16:00,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 16:16:00,570 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-08 16:16:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:00,574 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-08 16:16:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 16:16:00,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-08 16:16:00,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 16:16:00,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-08 16:16:00,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 16:16:00,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 16:16:00,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-08 16:16:00,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:16:00,579 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 16:16:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-08 16:16:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-08 16:16:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 16:16:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-08 16:16:00,595 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 16:16:00,595 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 16:16:00,595 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 16:16:00,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-08 16:16:00,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 16:16:00,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:00,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:00,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 16:16:00,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:00,596 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2018-12-08 16:16:00,596 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-12-08 16:16:00,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:00,597 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-08 16:16:00,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:00,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:00,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:00,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-08 16:16:00,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:00,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:00,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:00,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-08 16:16:00,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:00,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:00,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:00,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:00,796 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-08 16:16:00,936 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-08 16:16:01,087 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-12-08 16:16:01,152 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:16:01,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:16:01,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:16:01,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:16:01,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:16:01,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:01,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:16:01,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:16:01,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 16:16:01,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:16:01,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:16:01,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:01,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:01,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:01,442 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 16:16:01,444 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 16:16:01,445 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 16:16:01,447 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 16:16:01,448 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 16:16:01,449 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 16:16:01,450 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 16:16:01,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:01,454 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 16:16:01,455 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 16:16:01,456 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 16:16:01,457 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 16:16:01,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:01,460 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 16:16:01,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:01,772 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-12-08 16:16:01,861 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:16:01,864 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:16:01,865 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 16:16:01,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:01,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:01,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:01,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:01,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:01,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:01,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:01,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:01,870 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 16:16:01,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:01,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:01,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:01,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:01,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:01,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:01,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:01,874 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 16:16:01,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:01,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:01,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:01,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:01,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:01,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:01,895 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:16:01,908 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 16:16:01,908 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 16:16:01,909 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:16:01,910 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:16:01,911 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:16:01,911 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-12-08 16:16:01,933 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 16:16:01,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:16:01,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:01,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:01,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:01,991 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 16:16:01,993 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 16:16:01,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 16:16:02,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-08 16:16:02,034 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 16:16:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 16:16:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-08 16:16:02,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 16:16:02,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:02,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-08 16:16:02,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:02,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-08 16:16:02,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:02,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-08 16:16:02,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:02,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-08 16:16:02,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 16:16:02,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 16:16:02,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-08 16:16:02,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:02,038 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 16:16:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-08 16:16:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-08 16:16:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 16:16:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-08 16:16:02,040 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 16:16:02,040 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 16:16:02,040 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 16:16:02,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-08 16:16:02,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:02,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:02,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:02,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:02,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:02,041 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 182#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 184#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 194#L372-5 [2018-12-08 16:16:02,041 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 189#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 194#L372-5 [2018-12-08 16:16:02,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:02,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-08 16:16:02,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:02,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:02,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:02,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:02,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:02,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-08 16:16:02,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:02,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:02,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:02,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:02,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:02,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-08 16:16:02,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:02,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:02,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:02,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:02,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:02,375 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2018-12-08 16:16:02,454 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:16:02,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:16:02,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:16:02,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:16:02,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:16:02,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:02,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:16:02,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:16:02,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 16:16:02,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:16:02,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:16:02,457 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 16:16:02,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:02,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:02,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:02,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:02,469 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 16:16:02,471 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 16:16:02,473 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 16:16:02,699 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 16:16:02,700 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 16:16:02,701 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 16:16:02,701 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 16:16:02,702 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 16:16:02,703 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 16:16:02,704 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 16:16:02,705 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 16:16:02,706 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 16:16:02,707 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 16:16:02,709 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 16:16:03,081 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-08 16:16:03,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:16:03,092 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:16:03,092 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 16:16:03,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:03,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:03,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:03,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:03,094 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 16:16:03,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:03,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:03,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:03,097 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 16:16:03,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:03,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:03,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:03,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:03,098 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 16:16:03,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:03,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:03,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:03,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:03,100 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 16:16:03,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:03,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:03,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:03,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:03,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 16:16:03,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:03,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:03,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:03,105 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 16:16:03,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:03,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:03,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:03,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 16:16:03,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:03,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:03,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:03,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:03,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:03,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:03,121 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:16:03,132 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 16:16:03,132 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 16:16:03,132 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:16:03,133 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:16:03,133 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:16:03,134 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-08 16:16:03,188 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-08 16:16:03,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:16:03,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:03,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:03,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:03,240 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 16:16:03,240 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 16:16:03,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-08 16:16:03,271 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-08 16:16:03,271 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 16:16:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 16:16:03,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 16:16:03,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:03,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 16:16:03,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:03,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 16:16:03,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:03,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-08 16:16:03,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:03,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-08 16:16:03,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 16:16:03,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 16:16:03,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-08 16:16:03,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:03,274 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-08 16:16:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-08 16:16:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-08 16:16:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 16:16:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-08 16:16:03,276 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 16:16:03,276 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 16:16:03,276 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 16:16:03,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-08 16:16:03,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:03,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:03,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:03,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:03,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:03,277 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 376#L382 assume !(main_~length1~0 < 1); 377#L382-2 assume !(main_~length2~0 < 1); 374#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 370#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 371#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 384#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 380#L372-1 assume !cstrcspn_#t~short210; 381#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 366#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 367#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 368#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 369#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 373#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 383#L372-5 [2018-12-08 16:16:03,277 INFO L796 eck$LassoCheckResult]: Loop: 383#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 378#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 379#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 383#L372-5 [2018-12-08 16:16:03,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-08 16:16:03,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:03,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:03,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:03,296 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-08 16:16:03,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:03,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:03,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-12-08 16:16:03,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:03,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:03,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:03,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:16:03,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f249cbfb-de9f-4b5e-b671-e2e33d041276/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 16:16:03,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:03,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:03,429 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 16:16:03,431 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 16:16:03,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:16:03,448 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 16:16:03,451 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 16:16:03,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:16:03,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:16:03,464 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 16:16:03,469 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 16:16:03,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-08 16:16:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:16:15,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 16:16:15,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-12-08 16:16:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 16:16:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2018-12-08 16:16:15,672 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-12-08 16:16:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:16:15,791 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-08 16:16:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:16:15,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-12-08 16:16:15,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:15,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-12-08 16:16:15,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 16:16:15,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 16:16:15,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-12-08 16:16:15,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 16:16:15,794 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-08 16:16:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-12-08 16:16:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-12-08 16:16:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 16:16:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-08 16:16:15,796 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 16:16:15,796 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-08 16:16:15,796 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 16:16:15,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-08 16:16:15,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 16:16:15,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:16:15,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:16:15,797 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:16:15,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 16:16:15,797 INFO L794 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 531#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 532#L382 assume !(main_~length1~0 < 1); 533#L382-2 assume !(main_~length2~0 < 1); 530#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 526#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 527#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 546#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 536#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 537#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 522#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 523#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 524#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 525#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 529#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 539#L372-5 [2018-12-08 16:16:15,797 INFO L796 eck$LassoCheckResult]: Loop: 539#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 534#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 535#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 539#L372-5 [2018-12-08 16:16:15,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-08 16:16:15,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:15,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:15,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:15,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:16:15,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:15,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-08 16:16:15,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:15,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:15,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:15,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:15,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:15,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-08 16:16:15,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:16:15,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:16:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:15,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:16:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:16:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:16:16,308 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 139 [2018-12-08 16:16:17,050 WARN L180 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2018-12-08 16:16:17,052 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:16:17,052 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:16:17,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:16:17,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:16:17,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:16:17,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:16:17,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:16:17,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:16:17,053 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-08 16:16:17,053 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:16:17,053 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:16:17,056 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 16:16:17,058 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 16:16:17,059 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 16:16:17,060 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 16:16:17,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,067 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 16:16:17,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:16:17,073 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 16:16:17,073 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 16:16:17,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:16:17,618 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-12-08 16:16:18,521 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-12-08 16:16:18,686 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-08 16:16:18,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:16:18,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:16:18,691 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 16:16:18,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,694 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 16:16:18,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,696 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 16:16:18,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,698 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 16:16:18,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:18,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:18,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,701 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 16:16:18,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,703 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 16:16:18,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,705 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 16:16:18,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,707 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 16:16:18,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:18,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:18,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,709 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 16:16:18,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,711 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 16:16:18,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,713 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 16:16:18,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,714 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 16:16:18,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,716 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 16:16:18,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,717 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 16:16:18,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,719 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 16:16:18,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,720 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 16:16:18,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,722 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 16:16:18,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:16:18,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:16:18,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:16:18,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,724 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 16:16:18,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:18,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:18,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,728 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 16:16:18,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:18,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:18,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:16:18,730 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 16:16:18,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:16:18,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:16:18,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:16:18,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:16:18,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:16:18,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:16:18,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:16:18,762 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 16:16:18,762 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 16:16:18,762 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:16:18,763 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:16:18,763 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:16:18,763 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-12-08 16:16:18,839 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-12-08 16:16:18,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:16:18,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:18,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:18,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:18,879 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 16:16:18,879 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 16:16:18,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 16:16:18,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-12-08 16:16:18,902 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 16:16:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 16:16:18,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 16:16:18,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:18,902 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 16:16:18,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:18,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:18,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:18,950 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 16:16:18,950 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 16:16:18,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 16:16:18,971 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2018-12-08 16:16:18,971 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 16:16:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 16:16:18,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 16:16:18,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:18,971 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 16:16:18,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:16:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:18,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:16:19,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:16:19,018 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 16:16:19,018 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 16:16:19,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 16:16:19,040 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2018-12-08 16:16:19,040 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 16:16:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 16:16:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-08 16:16:19,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 16:16:19,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:19,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 16:16:19,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:19,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 16:16:19,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:16:19,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-12-08 16:16:19,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 16:16:19,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-12-08 16:16:19,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 16:16:19,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 16:16:19,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 16:16:19,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:16:19,043 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:16:19,043 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:16:19,043 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:16:19,043 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 16:16:19,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 16:16:19,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 16:16:19,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 16:16:19,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 04:16:19 BoogieIcfgContainer [2018-12-08 16:16:19,047 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 16:16:19,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:16:19,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:16:19,047 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:16:19,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:16:00" (3/4) ... [2018-12-08 16:16:19,050 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 16:16:19,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:16:19,051 INFO L168 Benchmark]: Toolchain (without parser) took 19225.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 950.6 MB in the beginning and 832.4 MB in the end (delta: 118.2 MB). Peak memory consumption was 311.2 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:19,051 INFO L168 Benchmark]: CDTParser took 0.13 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 16:16:19,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:19,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:19,052 INFO L168 Benchmark]: Boogie Preprocessor took 15.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:16:19,053 INFO L168 Benchmark]: RCFGBuilder took 200.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:19,053 INFO L168 Benchmark]: BuchiAutomizer took 18699.99 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 832.4 MB in the end (delta: 241.9 MB). Peak memory consumption was 319.5 MB. Max. memory is 11.5 GB. [2018-12-08 16:16:19,053 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 832.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:16:19,055 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18699.99 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 832.4 MB in the end (delta: 241.9 MB). Peak memory consumption was 319.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 832.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 18.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 144 SDslu, 98 SDs, 0 SdLazy, 153 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp33 div134 bol100 ite100 ukn100 eq167 hnf77 smp88 dnf1057 smp33 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...