./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/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 32bit --witnessprinter.graph.data.programhash 20f541ceeb4d88c1ded29d751212bcde5b7dc0f0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:50,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:50,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:50,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:50,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:50,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:50,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:50,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:50,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:50,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:50,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:50,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:50,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:50,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:50,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:50,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:50,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:50,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:50,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:50,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:50,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:50,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:50,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:50,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:50,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:50,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:50,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:50,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:50,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:50,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:50,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:50,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:50,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:50,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:50,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:50,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:50,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:50,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:50,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:50,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:50,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:50,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:56:50,965 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:50,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:50,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:50,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:50,966 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:50,967 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:50,967 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:50,967 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:50,967 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:50,967 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:50,967 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:50,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:50,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:50,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:50,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:50,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:50,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:50,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:50,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:50,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:50,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:50,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:50,969 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:50,969 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:50,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:50,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:50,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:50,971 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:50,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:50,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:50,971 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:50,972 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:50,972 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/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20f541ceeb4d88c1ded29d751212bcde5b7dc0f0 [2019-10-22 08:56:50,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:51,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:51,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:51,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:51,014 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:51,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2019-10-22 08:56:51,068 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/data/f720771f2/53b82d9c448f4fab8b2e1e05b10df4ae/FLAG033b93a76 [2019-10-22 08:56:51,517 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:51,517 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/sv-benchmarks/c/array-memsafety/subseq-alloca-2.i [2019-10-22 08:56:51,530 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/data/f720771f2/53b82d9c448f4fab8b2e1e05b10df4ae/FLAG033b93a76 [2019-10-22 08:56:52,038 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/bin/uautomizer/data/f720771f2/53b82d9c448f4fab8b2e1e05b10df4ae [2019-10-22 08:56:52,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:52,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:52,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:52,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:52,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:52,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa4e5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52, skipping insertion in model container [2019-10-22 08:56:52,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,060 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:52,104 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:52,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:52,433 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:52,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:52,513 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:52,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52 WrapperNode [2019-10-22 08:56:52,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:52,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:52,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:52,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:52,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:52,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:52,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:52,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:52,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:52,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:52,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:52,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:52,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bd5b9bb-afd8-45c6-8ef6-a8aa7da41035/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-10-22 08:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:52,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:52,960 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:52,960 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:56:52,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52 BoogieIcfgContainer [2019-10-22 08:56:52,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:52,962 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:52,962 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:52,966 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:52,967 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:52,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:52" (1/3) ... [2019-10-22 08:56:52,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32acee8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:52, skipping insertion in model container [2019-10-22 08:56:52,968 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:52,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (2/3) ... [2019-10-22 08:56:52,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32acee8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:52, skipping insertion in model container [2019-10-22 08:56:52,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:52,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52" (3/3) ... [2019-10-22 08:56:52,971 INFO L371 chiAutomizerObserver]: Analyzing ICFG subseq-alloca-2.i [2019-10-22 08:56:53,014 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:53,014 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:53,014 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:53,014 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:53,014 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:53,014 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:53,015 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:53,015 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:53,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-10-22 08:56:53,047 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:56:53,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:53,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:53,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:53,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:53,054 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:53,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-10-22 08:56:53,056 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:56:53,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:53,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:53,056 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:53,056 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:53,064 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 18#L530true assume !(main_~length1~0 < 1); 21#L530-2true assume !(main_~length2~0 < 1); 13#L533-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 5#L539-3true [2019-10-22 08:56:53,064 INFO L793 eck$LassoCheckResult]: Loop: 5#L539-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 3#L539-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 5#L539-3true [2019-10-22 08:56:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:56:53,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128326275] [2019-10-22 08:56:53,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,211 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 08:56:53,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330187612] [2019-10-22 08:56:53,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,228 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 08:56:53,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140791553] [2019-10-22 08:56:53,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,263 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,471 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-10-22 08:56:53,575 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:53,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:53,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:53,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:53,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:53,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:53,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:53,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:53,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration1_Lasso [2019-10-22 08:56:53,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:53,577 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:53,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:53,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,072 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:56:54,183 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:54,192 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:54,194 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-10-22 08:56:54,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:54,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:54,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:54,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:54,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:54,199 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:54,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:54,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:54,207 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-10-22 08:56:54,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:54,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:54,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:54,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:54,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:54,212 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:54,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:54,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:54,214 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-10-22 08:56:54,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:54,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:54,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:54,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:54,223 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:54,227 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:54,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:54,243 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-10-22 08:56:54,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:54,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:54,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:54,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:54,246 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:54,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:54,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:54,259 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-10-22 08:56:54,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:54,260 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:54,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:54,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:54,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:54,261 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:54,261 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:54,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:54,269 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-10-22 08:56:54,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:54,271 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:54,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:54,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:54,279 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:54,284 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:54,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:54,325 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-10-22 08:56:54,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:54,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:54,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:54,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:54,335 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:54,339 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:54,424 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:54,468 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:56:54,478 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:54,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:54,482 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:54,482 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:54,484 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:56:54,506 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:56:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:54,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:54,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:54,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:54,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:54,609 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-10-22 08:56:54,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-10-22 08:56:54,666 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 54 states and 79 transitions. Complement of second has 7 states. [2019-10-22 08:56:54,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-10-22 08:56:54,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:56:54,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:54,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:56:54,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:54,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:56:54,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:54,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 79 transitions. [2019-10-22 08:56:54,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:56:54,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 17 states and 24 transitions. [2019-10-22 08:56:54,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:56:54,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:56:54,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-10-22 08:56:54,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:54,683 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:56:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-10-22 08:56:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 08:56:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:56:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 08:56:54,710 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:56:54,711 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:56:54,711 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:54,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 08:56:54,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:56:54,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:54,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:54,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:54,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:54,713 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 158#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 159#L530 assume !(main_~length1~0 < 1); 163#L530-2 assume !(main_~length2~0 < 1); 160#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 152#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 153#L539-4 main_~i~1 := 0; 154#L545-3 [2019-10-22 08:56:54,713 INFO L793 eck$LassoCheckResult]: Loop: 154#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 157#L545-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 154#L545-3 [2019-10-22 08:56:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 08:56:54,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665190317] [2019-10-22 08:56:54,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,736 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 08:56:54,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502077182] [2019-10-22 08:56:54,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,746 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-10-22 08:56:54,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173699178] [2019-10-22 08:56:54,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,772 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:54,945 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:54,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:54,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:54,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:54,946 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:54,946 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:54,946 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:54,946 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:54,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration2_Lasso [2019-10-22 08:56:54,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:54,946 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:54,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-10-22 08:56:54,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,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-10-22 08:56:54,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-10-22 08:56:54,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:54,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-10-22 08:56:54,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-10-22 08:56:55,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:55,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:55,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:55,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:55,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:55,441 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:55,442 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:55,442 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-10-22 08:56:55,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,445 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-10-22 08:56:55,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,447 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,448 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-10-22 08:56:55,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,450 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,451 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-10-22 08:56:55,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,453 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,453 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,456 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-10-22 08:56:55,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,457 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,459 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-10-22 08:56:55,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,461 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,461 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,464 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-10-22 08:56:55,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,465 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,466 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,468 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-10-22 08:56:55,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,469 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,469 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,470 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,471 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-10-22 08:56:55,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,473 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,473 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,477 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-10-22 08:56:55,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,480 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,480 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,499 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:55,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:55,507 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:55,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:55,508 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:55,508 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:55,508 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~nondetString2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2019-10-22 08:56:55,532 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:56:55,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:55,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:55,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:55,575 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-10-22 08:56:55,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:56:55,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 25 states and 38 transitions. Complement of second has 6 states. [2019-10-22 08:56:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-10-22 08:56:55,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:56:55,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:55,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:56:55,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:55,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:56:55,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:55,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 38 transitions. [2019-10-22 08:56:55,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:55,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-10-22 08:56:55,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:56:55,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:56:55,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-10-22 08:56:55,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:55,609 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 08:56:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-10-22 08:56:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:56:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:56:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-10-22 08:56:55,611 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 08:56:55,611 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 08:56:55,611 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:55,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-10-22 08:56:55,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:55,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:55,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:55,612 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:55,612 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:55,613 INFO L791 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 275#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 276#L530 assume !(main_~length1~0 < 1); 280#L530-2 assume !(main_~length2~0 < 1); 277#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 268#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 269#L539-4 main_~i~1 := 0; 270#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 278#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 271#L518-5 [2019-10-22 08:56:55,613 INFO L793 eck$LassoCheckResult]: Loop: 271#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 272#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 266#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 267#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem5;havoc subseq_#t~mem6; 281#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 271#L518-5 [2019-10-22 08:56:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-10-22 08:56:55,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716907818] [2019-10-22 08:56:55,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,635 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 1 times [2019-10-22 08:56:55,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943738776] [2019-10-22 08:56:55,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:55,646 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1034036476, now seen corresponding path program 1 times [2019-10-22 08:56:55,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:55,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377629410] [2019-10-22 08:56:55,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:55,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:55,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377629410] [2019-10-22 08:56:55,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:55,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 08:56:55,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977364670] [2019-10-22 08:56:55,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:55,984 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-10-22 08:56:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:56,208 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-10-22 08:56:56,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:56,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-10-22 08:56:56,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-10-22 08:56:56,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-10-22 08:56:56,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 08:56:56,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:56:56,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-10-22 08:56:56,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:56,211 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-10-22 08:56:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-10-22 08:56:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-10-22 08:56:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:56:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2019-10-22 08:56:56,213 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-10-22 08:56:56,213 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-10-22 08:56:56,213 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:56,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2019-10-22 08:56:56,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:56:56,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:56,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:56,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:56,215 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:56,216 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 360#L530 assume !(main_~length1~0 < 1); 366#L530-2 assume !(main_~length2~0 < 1); 361#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 351#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 352#L539-4 main_~i~1 := 0; 362#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 363#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 371#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 368#L518-1 assume !subseq_#t~short4; 349#L518-3 [2019-10-22 08:56:56,216 INFO L793 eck$LassoCheckResult]: Loop: 349#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 350#L519 assume subseq_#t~mem5 == subseq_#t~mem6;havoc subseq_#t~mem5;havoc subseq_#t~mem6;subseq_#t~post7.base, subseq_#t~post7.offset := subseq_~ps~0.base, subseq_~ps~0.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_#t~post7.base, 1 + subseq_#t~post7.offset;havoc subseq_#t~post7.base, subseq_#t~post7.offset; 367#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 355#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 356#L518-1 assume !subseq_#t~short4; 349#L518-3 [2019-10-22 08:56:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759909, now seen corresponding path program 1 times [2019-10-22 08:56:56,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028363005] [2019-10-22 08:56:56,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash 85028899, now seen corresponding path program 1 times [2019-10-22 08:56:56,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908428216] [2019-10-22 08:56:56,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,256 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1514407799, now seen corresponding path program 1 times [2019-10-22 08:56:56,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310768622] [2019-10-22 08:56:56,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:56,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310768622] [2019-10-22 08:56:56,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:56,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:56,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818671377] [2019-10-22 08:56:56,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:56,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:56,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:56,398 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-10-22 08:56:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:56,411 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-10-22 08:56:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:56,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-10-22 08:56:56,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:56,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-10-22 08:56:56,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:56:56,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 08:56:56,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-10-22 08:56:56,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:56,415 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:56:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-10-22 08:56:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:56:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:56:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-22 08:56:56,417 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:56:56,417 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 08:56:56,417 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:56,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2019-10-22 08:56:56,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:56,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:56,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:56,418 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:56,418 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:56,421 INFO L791 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 424#L530 assume !(main_~length1~0 < 1); 430#L530-2 assume !(main_~length2~0 < 1); 422#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 414#L539-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 410#L539-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 411#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 416#L539-4 main_~i~1 := 0; 436#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 429#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 418#L518-5 [2019-10-22 08:56:56,421 INFO L793 eck$LassoCheckResult]: Loop: 418#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 419#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 412#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 413#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem5;havoc subseq_#t~mem6; 432#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 418#L518-5 [2019-10-22 08:56:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-10-22 08:56:56,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281778663] [2019-10-22 08:56:56,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,445 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 2 times [2019-10-22 08:56:56,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984768674] [2019-10-22 08:56:56,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,454 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1928298466, now seen corresponding path program 1 times [2019-10-22 08:56:56,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112194404] [2019-10-22 08:56:56,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:56:56,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112194404] [2019-10-22 08:56:56,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:56,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:56:56,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644693648] [2019-10-22 08:56:56,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:56,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:56:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:56,659 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand 8 states. [2019-10-22 08:56:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:56,742 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-22 08:56:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:56,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-10-22 08:56:56,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:56,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 36 transitions. [2019-10-22 08:56:56,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:56:56,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 08:56:56,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-10-22 08:56:56,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:56,744 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 08:56:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-10-22 08:56:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-22 08:56:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:56:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-10-22 08:56:56,754 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 08:56:56,754 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 08:56:56,754 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:56,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-10-22 08:56:56,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:56,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:56,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:56,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:56,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:56,756 INFO L791 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 506#L530 assume !(main_~length1~0 < 1); 513#L530-2 assume !(main_~length2~0 < 1); 507#L533-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 497#L539-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 493#L539-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 494#L539-3 assume !(main_~i~0 < main_~length1~0 - 1); 499#L539-4 main_~i~1 := 0; 508#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 509#L545-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 519#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 512#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 501#L518-5 [2019-10-22 08:56:56,756 INFO L793 eck$LassoCheckResult]: Loop: 501#L518-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 502#L518-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 495#L518-3 assume !!subseq_#t~short4;havoc subseq_#t~short4;havoc subseq_#t~mem2;havoc subseq_#t~mem3;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 496#L519 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem5;havoc subseq_#t~mem6; 515#L519-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 501#L518-5 [2019-10-22 08:56:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-10-22 08:56:56,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807393437] [2019-10-22 08:56:56,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,785 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 74536249, now seen corresponding path program 3 times [2019-10-22 08:56:56,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796926110] [2019-10-22 08:56:56,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,796 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1075475712, now seen corresponding path program 1 times [2019-10-22 08:56:56,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734431442] [2019-10-22 08:56:56,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,861 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:57,257 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2019-10-22 08:56:57,409 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-22 08:56:57,411 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:57,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:57,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:57,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:57,411 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:57,411 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:57,411 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:57,411 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:57,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-2.i_Iteration6_Lasso [2019-10-22 08:56:57,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:57,412 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:57,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,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-10-22 08:56:57,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-10-22 08:56:57,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-10-22 08:56:57,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-10-22 08:56:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,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-10-22 08:56:57,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-10-22 08:56:57,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-10-22 08:56:57,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,840 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-10-22 08:56:57,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-10-22 08:56:57,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-10-22 08:56:57,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-10-22 08:56:57,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:57,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-10-22 08:56:57,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,529 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:56:58,765 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:58,766 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:58,766 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-10-22 08:56:58,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,769 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-10-22 08:56:58,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,771 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-10-22 08:56:58,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,773 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-10-22 08:56:58,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,774 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,776 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-10-22 08:56:58,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,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-10-22 08:56:58,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,780 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-10-22 08:56:58,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,781 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,781 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,782 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-10-22 08:56:58,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,783 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,784 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-10-22 08:56:58,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,785 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,786 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-10-22 08:56:58,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,788 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-10-22 08:56:58,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,790 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,792 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-10-22 08:56:58,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,793 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,795 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-10-22 08:56:58,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,795 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,796 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,796 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,797 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-10-22 08:56:58,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,798 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,799 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,800 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-10-22 08:56:58,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,802 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-10-22 08:56:58,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,804 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-10-22 08:56:58,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,806 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,807 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-10-22 08:56:58,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,808 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:58,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,812 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:58,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,830 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-10-22 08:56:58,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,832 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,832 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,834 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-10-22 08:56:58,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,836 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,836 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,837 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-10-22 08:56:58,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,842 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,842 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,870 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:58,890 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:58,890 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:58,891 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:58,892 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:58,892 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:58,893 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~pt~0.offset, v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_1) = -1*ULTIMATE.start_subseq_~pt~0.offset + 1*v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_1 Supporting invariants [] [2019-10-22 08:56:58,980 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2019-10-22 08:56:58,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:59,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:59,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:59,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:59,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:59,030 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-10-22 08:56:59,030 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:56:59,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 35 states and 45 transitions. Complement of second has 6 states. [2019-10-22 08:56:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-10-22 08:56:59,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2019-10-22 08:56:59,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:59,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 5 letters. [2019-10-22 08:56:59,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:59,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 10 letters. [2019-10-22 08:56:59,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:59,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-10-22 08:56:59,051 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:59,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-10-22 08:56:59,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:59,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:59,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:59,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:59,052 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:59,052 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:59,052 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:59,052 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:59,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:59,052 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:59,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:59,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:59 BoogieIcfgContainer [2019-10-22 08:56:59,058 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:59,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:59,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:59,058 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:59,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52" (3/4) ... [2019-10-22 08:56:59,061 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:59,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:59,062 INFO L168 Benchmark]: Toolchain (without parser) took 7019.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 935.6 MB in the beginning and 910.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,063 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:59,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.56 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-10-22 08:56:59,064 INFO L168 Benchmark]: Boogie Preprocessor took 27.03 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,064 INFO L168 Benchmark]: RCFGBuilder took 375.34 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.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,065 INFO L168 Benchmark]: BuchiAutomizer took 6095.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 910.0 MB in the end (delta: 187.3 MB). Peak memory consumption was 239.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:59,065 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 910.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:59,068 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.03 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.34 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.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6095.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 910.0 MB in the end (delta: 187.3 MB). Peak memory consumption was 239.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 910.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * i + -1 * nondetString2 and consists of 4 locations. One deterministic module has affine ranking function -1 * pt + unknown-#length-unknown[pt] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 176 SDslu, 156 SDs, 0 SdLazy, 144 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax110 hnf98 lsp84 ukn74 mio100 lsp47 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf162 smp95 tf100 neg94 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 5 VariablesLoop: 2 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...