./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-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_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/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 8e7a3bf93085b5e270d45bd0dc9d7e17d0c05479 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:58:16,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:16,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:16,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:16,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:16,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:16,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:16,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:17,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:17,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:17,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:17,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:17,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:17,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:17,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:17,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:17,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:17,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:17,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:17,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:17,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:17,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:17,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:17,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:17,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:17,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:17,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:17,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:17,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:17,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:17,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:17,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:17,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:17,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:17,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:17,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:17,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:17,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:17,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:17,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:17,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:17,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:58:17,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:17,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:17,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:17,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:17,050 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:17,051 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:17,051 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:17,051 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:17,051 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:17,052 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:17,052 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:17,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:17,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:17,053 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:17,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:17,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:17,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:17,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:17,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:17,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:17,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:17,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:17,055 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:17,055 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:17,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:17,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:17,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:17,056 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:17,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:17,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:17,057 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:17,058 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:17,058 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_9f4f10a0-497b-4669-984f-d5e8433e931b/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 -> 8e7a3bf93085b5e270d45bd0dc9d7e17d0c05479 [2019-10-22 08:58:17,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:17,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:17,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:17,104 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:17,105 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:17,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2019-10-22 08:58:17,162 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/data/811b76314/bbc17baa2f9c49eaadcce8aab337c24a/FLAGb3af2a40c [2019-10-22 08:58:17,622 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:17,622 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2019-10-22 08:58:17,633 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/data/811b76314/bbc17baa2f9c49eaadcce8aab337c24a/FLAGb3af2a40c [2019-10-22 08:58:17,921 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/bin/uautomizer/data/811b76314/bbc17baa2f9c49eaadcce8aab337c24a [2019-10-22 08:58:17,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:17,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:17,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:17,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:17,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:17,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:17" (1/1) ... [2019-10-22 08:58:17,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6695a6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:17, skipping insertion in model container [2019-10-22 08:58:17,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:17" (1/1) ... [2019-10-22 08:58:17,953 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:17,993 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:18,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:18,495 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:18,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:18,588 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:18,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18 WrapperNode [2019-10-22 08:58:18,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:18,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:18,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:18,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:18,599 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:58:18" (1/1) ... [2019-10-22 08:58:18,618 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:58:18" (1/1) ... [2019-10-22 08:58:18,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:18,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:18,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:18,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:18,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:18,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:18,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:18,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:18,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f4f10a0-497b-4669-984f-d5e8433e931b/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:58:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:18,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:19,069 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:19,070 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:58:19,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:19 BoogieIcfgContainer [2019-10-22 08:58:19,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:19,072 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:19,072 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:19,076 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:19,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:19,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:17" (1/3) ... [2019-10-22 08:58:19,079 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1096991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:19, skipping insertion in model container [2019-10-22 08:58:19,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:19,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (2/3) ... [2019-10-22 08:58:19,079 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1096991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:19, skipping insertion in model container [2019-10-22 08:58:19,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:19,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:19" (3/3) ... [2019-10-22 08:58:19,082 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cmemchr-alloca-2.i [2019-10-22 08:58:19,132 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:19,132 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:19,132 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:19,132 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:19,132 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:19,132 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:19,133 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:19,133 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:19,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:19,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:19,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:19,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:19,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:19,181 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:19,181 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:19,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:19,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:19,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:19,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:19,184 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:19,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:19,193 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 17#L529true assume !(main_~length~0 < 1); 20#L529-2true assume !(main_~n~0 < 1); 14#L532-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L537-3true [2019-10-22 08:58:19,193 INFO L793 eck$LassoCheckResult]: Loop: 8#L537-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 7#L537-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L537-3true [2019-10-22 08:58:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:58:19,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720810352] [2019-10-22 08:58:19,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,338 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 08:58:19,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438720826] [2019-10-22 08:58:19,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,359 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 08:58:19,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766166179] [2019-10-22 08:58:19,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,425 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:19,635 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:19,636 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:19,636 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:19,636 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:19,636 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:19,636 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:19,636 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:19,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:19,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca-2.i_Iteration1_Lasso [2019-10-22 08:58:19,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:19,637 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:19,663 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:58:19,670 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:58:19,673 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:58:19,676 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:58:19,684 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:58:19,688 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:58:19,695 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:58:19,698 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:58:19,702 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:58:19,708 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:58:19,724 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:58:19,729 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:58:19,734 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:58:19,879 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:58:20,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:20,157 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:20,159 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:58:20,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,166 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,171 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:58:20,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,175 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:58:20,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,178 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:58:20,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,179 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,184 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:58:20,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,188 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:58:20,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,191 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:20,194 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:20,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,201 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:58:20,203 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,206 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:58:20,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,212 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:20,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:20,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,232 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:58:20,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,235 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:20,235 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:20,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,246 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:58:20,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,250 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:20,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:20,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,254 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:58:20,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,255 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,255 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,255 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,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:58:20,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,262 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:20,262 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:20,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,273 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:58:20,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:20,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,275 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:20,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:20,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:20,278 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:58:20,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:20,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:20,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:20,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:20,283 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:20,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:20,346 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:20,402 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:20,403 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:20,405 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:20,406 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:20,406 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:20,407 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 08:58:20,424 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:58:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,504 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:58:20,520 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:58:20,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-10-22 08:58:20,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 42 states and 59 transitions. Complement of second has 7 states. [2019-10-22 08:58:20,564 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:58:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-10-22 08:58:20,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:58:20,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:58:20,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:58:20,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:20,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 59 transitions. [2019-10-22 08:58:20,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:58:20,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 18 transitions. [2019-10-22 08:58:20,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:58:20,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:58:20,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-10-22 08:58:20,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:20,580 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:58:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-10-22 08:58:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:58:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:58:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-10-22 08:58:20,611 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:58:20,611 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 08:58:20,611 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:20,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-10-22 08:58:20,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:58:20,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:20,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:20,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:58:20,616 INFO L791 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 128#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 129#L529 assume !(main_~length~0 < 1); 133#L529-2 assume !(main_~n~0 < 1); 131#L532-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 126#L537-3 assume !(main_~i~0 < main_~length~0); 127#L537-4 cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 122#L516 assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 121#L518-4 [2019-10-22 08:58:20,616 INFO L793 eck$LassoCheckResult]: Loop: 121#L518-4 cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 123#L519 assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~mem4;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset; 132#L518-1 cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 120#L518-2 assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 121#L518-4 [2019-10-22 08:58:20,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,617 INFO L82 PathProgramCache]: Analyzing trace with hash 180430706, now seen corresponding path program 1 times [2019-10-22 08:58:20,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312865803] [2019-10-22 08:58:20,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,689 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:58:20,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312865803] [2019-10-22 08:58:20,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:20,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:20,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362206071] [2019-10-22 08:58:20,694 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 1 times [2019-10-22 08:58:20,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028787084] [2019-10-22 08:58:20,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,716 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:20,776 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:58:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:20,801 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-10-22 08:58:20,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:20,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-10-22 08:58:20,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:58:20,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2019-10-22 08:58:20,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:58:20,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:58:20,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-10-22 08:58:20,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:20,806 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 08:58:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-10-22 08:58:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 08:58:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:58:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-10-22 08:58:20,810 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:58:20,810 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:58:20,810 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:20,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-10-22 08:58:20,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:58:20,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:20,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:20,812 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:58:20,812 INFO L791 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 165#L529 assume !(main_~length~0 < 1); 169#L529-2 assume !(main_~n~0 < 1); 167#L532-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 162#L537-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 160#L537-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 161#L537-3 assume !(main_~i~0 < main_~length~0); 163#L537-4 cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 156#L516 assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 157#L518-4 [2019-10-22 08:58:20,812 INFO L793 eck$LassoCheckResult]: Loop: 157#L518-4 cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 159#L519 assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~mem4;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset; 168#L518-1 cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 158#L518-2 assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 157#L518-4 [2019-10-22 08:58:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1596934864, now seen corresponding path program 1 times [2019-10-22 08:58:20,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187342575] [2019-10-22 08:58:20,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,862 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 2 times [2019-10-22 08:58:20,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884618176] [2019-10-22 08:58:20,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,894 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1308516218, now seen corresponding path program 1 times [2019-10-22 08:58:20,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776467382] [2019-10-22 08:58:20,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,962 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:21,255 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-10-22 08:58:21,364 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:21,364 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:21,364 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:21,364 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:21,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:21,365 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:21,365 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:21,365 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:21,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca-2.i_Iteration3_Lasso [2019-10-22 08:58:21,365 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:21,365 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:21,369 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:58:21,384 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:58:21,386 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:58:21,392 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:58:21,400 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:58:21,403 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:58:21,550 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 08:58:21,619 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:58:21,624 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:58:21,630 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:58:21,636 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:58:21,638 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:58:21,639 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:58:21,641 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:58:21,643 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:58:21,646 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:58:21,648 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:58:21,650 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:58:21,653 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:58:21,655 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:58:21,658 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:58:21,659 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:58:21,880 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-22 08:58:21,983 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-10-22 08:58:22,256 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:22,257 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:22,257 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:58:22,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:22,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:22,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,264 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:58:22,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,265 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:22,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,266 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,266 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:22,266 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:22,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,267 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:58:22,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:22,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:22,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:22,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,270 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:58:22,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,271 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:22,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,272 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:22,272 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:22,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,273 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:58:22,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,274 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:22,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,275 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:22,275 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:22,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,276 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:58:22,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,277 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:22,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,284 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:58:22,285 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:58:22,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,320 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:58:22,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,321 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:58:22,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,324 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:58:22,324 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:22,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,336 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:58:22,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,338 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:22,339 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:22,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,346 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:58:22,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,348 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:22,348 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:22,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:22,350 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:58:22,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:22,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:22,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:22,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:22,355 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:22,356 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:22,440 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:22,465 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:22,465 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:22,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:22,467 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:22,467 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:22,467 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cmemchr_~p~0.offset, v_rep(select #length ULTIMATE.start_cmemchr_~p~0.base)_1) = -1*ULTIMATE.start_cmemchr_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_cmemchr_~p~0.base)_1 Supporting invariants [] [2019-10-22 08:58:22,483 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:58:22,485 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:22,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:22,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:22,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:58:22,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:22,559 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:58:22,560 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:58:22,560 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:58:22,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 21 transitions. Complement of second has 4 states. [2019-10-22 08:58:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 08:58:22,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:58:22,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:22,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:58:22,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:22,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 08:58:22,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:22,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-10-22 08:58:22,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:22,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-10-22 08:58:22,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:22,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:22,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:22,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:22,572 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:22,572 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:22,572 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:22,572 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:22,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:22,573 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:22,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:22,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:22 BoogieIcfgContainer [2019-10-22 08:58:22,579 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:22,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:22,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:22,580 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:22,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:19" (3/4) ... [2019-10-22 08:58:22,584 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:22,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:22,586 INFO L168 Benchmark]: Toolchain (without parser) took 4659.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.4 MB in the beginning and 885.3 MB in the end (delta: 55.2 MB). Peak memory consumption was 181.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:22,586 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:22,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:22,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.74 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:22,588 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:22,588 INFO L168 Benchmark]: RCFGBuilder took 399.28 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:22,589 INFO L168 Benchmark]: BuchiAutomizer took 3507.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 885.3 MB in the end (delta: 199.8 MB). Peak memory consumption was 199.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:22,589 INFO L168 Benchmark]: Witness Printer took 5.02 ms. Allocated memory is still 1.2 GB. Free memory is still 885.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:22,592 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 660.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.74 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.23 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.28 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3507.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 885.3 MB in the end (delta: 199.8 MB). Peak memory consumption was 199.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.02 ms. Allocated memory is still 1.2 GB. Free memory is still 885.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * p + unknown-#length-unknown[p] and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 48 SDtfs, 47 SDslu, 38 SDs, 0 SdLazy, 16 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital126 mio100 ax115 hnf98 lsp79 ukn89 mio100 lsp56 div154 bol100 ite100 ukn100 eq167 hnf77 smp95 dnf100 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...