./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/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.24-cad4683 [2019-11-15 21:56:49,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:56:49,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:56:49,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:56:49,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:56:49,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:56:49,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:56:49,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:56:49,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:56:49,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:56:49,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:56:49,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:56:49,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:56:49,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:56:49,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:56:49,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:56:49,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:56:49,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:56:49,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:56:49,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:56:49,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:56:49,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:56:49,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:56:49,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:56:49,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:56:49,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:56:49,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:56:49,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:56:49,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:56:49,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:56:49,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:56:49,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:56:49,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:56:49,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:56:49,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:56:49,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:56:49,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:56:49,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:56:49,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:56:49,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:56:49,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:56:49,821 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:56:49,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:56:49,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:56:49,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:56:49,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:56:49,837 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:56:49,837 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:56:49,837 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:56:49,838 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:56:49,838 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:56:49,838 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:56:49,838 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:56:49,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:56:49,839 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:56:49,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:56:49,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:56:49,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:56:49,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:56:49,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:56:49,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:56:49,841 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:56:49,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:56:49,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:56:49,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:56:49,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:56:49,842 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:56:49,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:56:49,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:56:49,843 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:56:49,843 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:56:49,844 INFO L138 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/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/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 [2019-11-15 21:56:49,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:56:49,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:56:49,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:56:49,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:56:49,903 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:56:49,904 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2019-11-15 21:56:49,958 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/data/e3a619ee5/1d0349b80bb643e7807712931dea436a/FLAGa5a75738e [2019-11-15 21:56:50,408 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:56:50,408 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2019-11-15 21:56:50,419 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/data/e3a619ee5/1d0349b80bb643e7807712931dea436a/FLAGa5a75738e [2019-11-15 21:56:50,430 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/data/e3a619ee5/1d0349b80bb643e7807712931dea436a [2019-11-15 21:56:50,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:56:50,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:56:50,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:56:50,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:56:50,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:56:50,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f1b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50, skipping insertion in model container [2019-11-15 21:56:50,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,448 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:56:50,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:56:50,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:56:50,816 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:56:50,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:56:50,929 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:56:50,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50 WrapperNode [2019-11-15 21:56:50,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:56:50,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:56:50,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:56:50,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:56:50,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:56:50,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:56:50,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:56:50,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:56:50,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:50,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:51,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:51,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... [2019-11-15 21:56:51,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:56:51,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:56:51,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:56:51,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:56:51,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/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 [2019-11-15 21:56:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:56:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:56:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:56:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:56:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:56:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:56:51,329 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:56:51,329 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:56:51,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:51 BoogieIcfgContainer [2019-11-15 21:56:51,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:56:51,331 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:56:51,331 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:56:51,334 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:56:51,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:51,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:56:50" (1/3) ... [2019-11-15 21:56:51,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eb058cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:56:51, skipping insertion in model container [2019-11-15 21:56:51,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:51,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:56:50" (2/3) ... [2019-11-15 21:56:51,336 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eb058cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:56:51, skipping insertion in model container [2019-11-15 21:56:51,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:56:51,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:51" (3/3) ... [2019-11-15 21:56:51,338 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2019-11-15 21:56:51,390 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:56:51,391 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:56:51,391 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:56:51,391 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:56:51,391 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:56:51,392 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:56:51,392 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:56:51,392 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:56:51,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:56:51,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:56:51,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:51,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:51,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:56:51,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:56:51,427 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:56:51,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:56:51,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:56:51,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:51,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:51,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:56:51,430 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:56:51,437 INFO L791 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.allocOnStack(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.allocOnStack(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 [2019-11-15 21:56:51,438 INFO L793 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 [2019-11-15 21:56:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 21:56:51,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:51,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831583725] [2019-11-15 21:56:51,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,582 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 21:56:51,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:51,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207223636] [2019-11-15 21:56:51,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:51,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207223636] [2019-11-15 21:56:51,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:56:51,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:56:51,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914282744] [2019-11-15 21:56:51,616 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:56:51,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:56:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:56:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:56:51,628 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 21:56:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:51,633 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 21:56:51,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:56:51,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 21:56:51,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:56:51,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 21:56:51,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:56:51,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:56:51,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 21:56:51,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:56:51,641 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:56:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 21:56:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 21:56:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:56:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 21:56:51,662 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:56:51,662 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:56:51,662 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:56:51,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 21:56:51,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:56:51,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:51,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:51,664 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:56:51,664 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:56:51,664 INFO L791 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.allocOnStack(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.allocOnStack(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 [2019-11-15 21:56:51,664 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;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 [2019-11-15 21:56:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 21:56:51,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:51,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262711914] [2019-11-15 21:56:51,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,705 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 21:56:51,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:51,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648308134] [2019-11-15 21:56:51,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 21:56:51,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:51,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090443783] [2019-11-15 21:56:51,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:51,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:51,822 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:52,066 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-15 21:56:52,361 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-11-15 21:56:52,721 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-11-15 21:56:52,872 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-15 21:56:52,883 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:52,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:52,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:52,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:52,885 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:52,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:52,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:52,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:52,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration2_Lasso [2019-11-15 21:56:52,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:52,886 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:52,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:52,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:53,363 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-15 21:56:53,545 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-15 21:56:53,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:53,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:53,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:53,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:54,357 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 21:56:54,661 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-11-15 21:56:54,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:54,732 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:54,734 INFO L120 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 [2019-11-15 21:56:54,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,739 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,741 INFO L120 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 [2019-11-15 21:56:54,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,744 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:54,744 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:54,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,747 INFO L120 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 [2019-11-15 21:56:54,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,751 INFO L120 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 [2019-11-15 21:56:54,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,753 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:54,753 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:54,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,757 INFO L120 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 [2019-11-15 21:56:54,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,758 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,760 INFO L120 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 [2019-11-15 21:56:54,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,760 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,763 INFO L120 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 [2019-11-15 21:56:54,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,765 INFO L120 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 [2019-11-15 21:56:54,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,772 INFO L120 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 [2019-11-15 21:56:54,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,775 INFO L120 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 [2019-11-15 21:56:54,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,778 INFO L120 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 [2019-11-15 21:56:54,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,781 INFO L120 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 [2019-11-15 21:56:54,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,783 INFO L120 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 [2019-11-15 21:56:54,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:54,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:54,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:54,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:54,796 INFO L120 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 [2019-11-15 21:56:54,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:54,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:54,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:54,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:54,803 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:54,808 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:54,877 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:56:54,960 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:56:54,961 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:56:54,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:56:54,966 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:56:54,966 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:56:54,967 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2019-11-15 21:56:55,012 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 21:56:55,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:56:55,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:55,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:55,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:55,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:56:55,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:55,118 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 [2019-11-15 21:56:55,119 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:56:55,161 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. [2019-11-15 21:56:55,163 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 [2019-11-15 21:56:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 21:56:55,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 21:56:55,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:55,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 21:56:55,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:55,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 21:56:55,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:55,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 21:56:55,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:56:55,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 21:56:55,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:56:55,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:56:55,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 21:56:55,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:56:55,170 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:56:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 21:56:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 21:56:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:56:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 21:56:55,172 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:56:55,172 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:56:55,172 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:56:55,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 21:56:55,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:56:55,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:55,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:55,174 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:56:55,174 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:56:55,174 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#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; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#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; 189#L372-5 [2019-11-15 21:56:55,175 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 184#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); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;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; 189#L372-5 [2019-11-15 21:56:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 21:56:55,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:55,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136497277] [2019-11-15 21:56:55,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:55,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:55,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:55,208 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 21:56:55,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:55,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154258343] [2019-11-15 21:56:55,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:55,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:55,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:55,220 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 21:56:55,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:55,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423998043] [2019-11-15 21:56:55,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:55,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:55,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:55,260 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:55,834 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-11-15 21:56:55,950 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 21:56:55,951 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:56:55,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:56:55,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:56:55,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:56:55,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:56:55,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:56:55,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:56:55,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:56:55,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration3_Lasso [2019-11-15 21:56:55,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:56:55,952 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:56:55,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:55,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,307 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-15 21:56:56,440 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-15 21:56:56,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:56:56,636 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-15 21:56:57,262 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:56:57,469 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-15 21:56:57,486 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:56:57,487 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:56:57,487 INFO L120 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 [2019-11-15 21:56:57,488 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,488 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:57,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,489 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:57,489 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:57,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,490 INFO L120 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 [2019-11-15 21:56:57,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,492 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:57,492 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:57,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,494 INFO L120 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 [2019-11-15 21:56:57,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:57,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:57,496 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:57,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,497 INFO L120 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 [2019-11-15 21:56:57,497 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,498 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:57,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,498 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:57,499 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:57,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,500 INFO L120 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 [2019-11-15 21:56:57,500 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,500 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:57,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,501 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,501 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:57,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:57,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,502 INFO L120 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 [2019-11-15 21:56:57,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:57,504 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:57,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,507 INFO L120 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 [2019-11-15 21:56:57,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,507 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,509 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:57,509 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:57,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,511 INFO L120 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 [2019-11-15 21:56:57,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,512 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:57,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,513 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:57,513 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:57,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,514 INFO L120 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 [2019-11-15 21:56:57,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:56:57,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:56:57,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:56:57,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:56:57,517 INFO L120 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 [2019-11-15 21:56:57,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:56:57,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:56:57,518 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:56:57,518 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:56:57,523 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:56:57,523 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:56:57,551 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:56:57,574 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:56:57,574 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:56:57,575 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:56:57,576 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:56:57,577 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:56:57,577 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-11-15 21:56:57,630 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-11-15 21:56:57,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:56:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:56:57,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:56:57,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:57,693 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 [2019-11-15 21:56:57,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 21:56:57,728 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-11-15 21:56:57,729 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 [2019-11-15 21:56:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:56:57,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:56:57,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 21:56:57,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:57,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 21:56:57,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:57,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 21:56:57,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:56:57,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 21:56:57,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:56:57,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 21:56:57,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:56:57,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:56:57,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 21:56:57,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:56:57,734 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 21:56:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 21:56:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 21:56:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 21:56:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 21:56:57,742 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 21:56:57,743 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 21:56:57,743 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:56:57,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 21:56:57,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:56:57,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:56:57,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:56:57,746 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:56:57,746 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:56:57,746 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#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; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 357#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 358#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; 371#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 367#L372-1 assume !cstrcspn_#t~short210; 368#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 353#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 354#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 355#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; 356#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 360#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; 370#L372-5 [2019-11-15 21:56:57,747 INFO L793 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 365#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); 366#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;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; 370#L372-5 [2019-11-15 21:56:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 21:56:57,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:57,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535135515] [2019-11-15 21:56:57,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:57,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:57,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:57,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 21:56:57,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:57,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283977194] [2019-11-15 21:56:57,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:57,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:57,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:56:57,823 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:56:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-11-15 21:56:57,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:57,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634184073] [2019-11-15 21:56:57,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:57,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:57,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:56:57,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634184073] [2019-11-15 21:56:57,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377859925] [2019-11-15 21:56:57,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4af5d537-c26c-4c4f-aebc-20e67f22b6f4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 21:56:57,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:58,034 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-15 21:56:58,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-15 21:56:58,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:58,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:58,040 INFO L496 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. [2019-11-15 21:56:58,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-11-15 21:57:10,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:57:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:10,183 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:57:10,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 21:57:10,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736694556] [2019-11-15 21:57:10,399 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-15 21:57:10,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:10,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:57:10,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2019-11-15 21:57:10,400 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-11-15 21:57:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:10,602 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-15 21:57:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:57:10,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-11-15 21:57:10,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:57:10,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-11-15 21:57:10,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 21:57:10,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:57:10,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-15 21:57:10,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:57:10,608 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 21:57:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-15 21:57:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-11-15 21:57:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 21:57:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-15 21:57:10,612 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 21:57:10,612 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 21:57:10,612 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:57:10,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-15 21:57:10,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:57:10,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:57:10,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:57:10,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:10,614 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:57:10,614 INFO L791 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 518#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; 519#L382 assume !(main_~length1~0 < 1); 520#L382-2 assume !(main_~length2~0 < 1); 517#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(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; 513#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 514#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; 533#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 523#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); 524#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 509#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 510#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 511#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; 512#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 516#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; 526#L372-5 [2019-11-15 21:57:10,614 INFO L793 eck$LassoCheckResult]: Loop: 526#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 521#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); 522#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;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; 526#L372-5 [2019-11-15 21:57:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 21:57:10,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:10,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598335222] [2019-11-15 21:57:10,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:57:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:57:10,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:57:10,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 21:57:10,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:10,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603048409] [2019-11-15 21:57:10,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:57:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:57:10,650 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:57:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:10,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 21:57:10,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:10,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639908554] [2019-11-15 21:57:10,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:57:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:57:10,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:57:11,494 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 142 [2019-11-15 21:57:12,520 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 114 DAG size of output: 114 [2019-11-15 21:57:12,522 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:57:12,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:57:12,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:57:12,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:57:12,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:57:12,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:57:12,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:57:12,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:57:12,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration5_Lasso [2019-11-15 21:57:12,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:57:12,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:57:12,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:12,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 21:57:13,538 WARN L191 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2019-11-15 21:57:13,667 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-15 21:57:13,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:57:13,915 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-15 21:57:14,457 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:57:15,238 WARN L191 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-11-15 21:57:15,410 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-15 21:57:15,423 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:57:15,423 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:57:15,424 INFO L120 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 [2019-11-15 21:57:15,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:57:15,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:57:15,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:57:15,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,426 INFO L120 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 [2019-11-15 21:57:15,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,426 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:57:15,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,427 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:57:15,427 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:57:15,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,427 INFO L120 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 [2019-11-15 21:57:15,428 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,428 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:57:15,428 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,428 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,428 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,428 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:57:15,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:57:15,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,429 INFO L120 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 [2019-11-15 21:57:15,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,430 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:57:15,430 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:57:15,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,432 INFO L120 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 [2019-11-15 21:57:15,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,432 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:57:15,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,433 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:57:15,433 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:57:15,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,433 INFO L120 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 [2019-11-15 21:57:15,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:57:15,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:57:15,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:57:15,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,435 INFO L120 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 [2019-11-15 21:57:15,435 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:57:15,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,438 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:57:15,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:57:15,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,439 INFO L120 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 [2019-11-15 21:57:15,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,441 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:57:15,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:57:15,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,446 INFO L120 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 [2019-11-15 21:57:15,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,447 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:57:15,448 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:57:15,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,449 INFO L120 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 [2019-11-15 21:57:15,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,450 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:57:15,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,455 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:57:15,455 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:57:15,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:57:15,474 INFO L120 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 [2019-11-15 21:57:15,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:57:15,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:57:15,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:57:15,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:57:15,478 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:57:15,478 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:57:15,497 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:57:15,526 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:57:15,526 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:57:15,526 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:57:15,527 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:57:15,528 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:57:15,528 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 Supporting invariants [] [2019-11-15 21:57:15,645 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-11-15 21:57:15,646 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:57:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:15,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:57:15,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:15,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:57:15,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:15,703 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 [2019-11-15 21:57:15,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:57:15,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 21:57:15,730 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 [2019-11-15 21:57:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:57:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:57:15,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:57:15,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:57:15,731 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:57:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:15,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:57:15,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:15,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:57:15,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:15,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:57:15,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:57:15,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 21:57:15,805 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 [2019-11-15 21:57:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:57:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:57:15,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:57:15,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:57:15,806 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:57:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:15,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:57:15,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:15,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:57:15,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:15,858 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:57:15,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:57:15,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-11-15 21:57:15,878 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 [2019-11-15 21:57:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:57:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 21:57:15,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:57:15,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:57:15,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 21:57:15,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:57:15,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 21:57:15,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:57:15,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-11-15 21:57:15,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:57:15,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-11-15 21:57:15,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:57:15,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:57:15,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:57:15,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:57:15,883 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:57:15,883 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:57:15,883 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:57:15,883 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:57:15,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:57:15,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:57:15,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:57:15,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:57:15 BoogieIcfgContainer [2019-11-15 21:57:15,888 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:57:15,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:57:15,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:57:15,889 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:57:15,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:56:51" (3/4) ... [2019-11-15 21:57:15,892 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:57:15,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:57:15,894 INFO L168 Benchmark]: Toolchain (without parser) took 25460.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.3 MB). Free memory was 938.0 MB in the beginning and 881.2 MB in the end (delta: 56.8 MB). Peak memory consumption was 408.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:57:15,894 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:57:15,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:57:15,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:57:15,896 INFO L168 Benchmark]: Boogie Preprocessor took 27.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:57:15,897 INFO L168 Benchmark]: RCFGBuilder took 323.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:57:15,897 INFO L168 Benchmark]: BuchiAutomizer took 24557.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 204.9 MB). Peak memory consumption was 415.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:57:15,898 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.4 GB. Free memory is still 881.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:57:15,901 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 495.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 323.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24557.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 204.9 MB). Peak memory consumption was 415.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 ms. Allocated memory is still 1.4 GB. Free memory is still 881.2 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[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 23.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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: 106 SDtfs, 147 SDslu, 80 SDs, 0 SdLazy, 140 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital381 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp32 div127 bol100 ite100 ukn100 eq167 hnf81 smp88 dnf1011 smp36 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 11 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...