./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e9d8db831e66fcf4f47c300fcbd3a74f1185238a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:10:56,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:10:56,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:10:56,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:10:56,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:10:56,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:10:56,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:10:56,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:10:56,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:10:56,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:10:56,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:10:56,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:10:56,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:10:56,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:10:56,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:10:56,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:10:56,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:10:56,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:10:56,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:10:56,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:10:56,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:10:56,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:10:56,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:10:56,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:10:56,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:10:56,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:10:56,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:10:56,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:10:56,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:10:56,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:10:56,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:10:56,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:10:56,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:10:56,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:10:56,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:10:56,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:10:56,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:10:56,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:10:56,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:10:56,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:10:56,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:10:56,953 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:10:56,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:10:56,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:10:56,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:10:56,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:10:56,991 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:10:56,991 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:10:56,991 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:10:56,991 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:10:56,991 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:10:56,992 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:10:56,992 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:10:56,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:10:56,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:10:56,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:10:56,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:10:56,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:10:56,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:10:56,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:10:56,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:10:56,994 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:10:56,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:10:56,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:10:56,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:10:56,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:10:56,995 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:10:56,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:10:56,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:10:56,995 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:10:56,996 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:10:56,996 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9d8db831e66fcf4f47c300fcbd3a74f1185238a [2019-11-15 23:10:57,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:10:57,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:10:57,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:10:57,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:10:57,042 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:10:57,043 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2019-11-15 23:10:57,093 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/data/f44d406ba/c778f51e1acc413db35efa751efeada2/FLAG46aeddaa2 [2019-11-15 23:10:57,568 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:10:57,568 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2019-11-15 23:10:57,583 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/data/f44d406ba/c778f51e1acc413db35efa751efeada2/FLAG46aeddaa2 [2019-11-15 23:10:57,887 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/data/f44d406ba/c778f51e1acc413db35efa751efeada2 [2019-11-15 23:10:57,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:10:57,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:10:57,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:10:57,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:10:57,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:10:57,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:10:57" (1/1) ... [2019-11-15 23:10:57,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce673cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:57, skipping insertion in model container [2019-11-15 23:10:57,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:10:57" (1/1) ... [2019-11-15 23:10:57,905 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:10:57,939 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:10:58,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:10:58,289 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:10:58,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:10:58,379 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:10:58,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58 WrapperNode [2019-11-15 23:10:58,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:10:58,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:10:58,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:10:58,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:10:58,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:10:58,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:10:58,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:10:58,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:10:58,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... [2019-11-15 23:10:58,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:10:58,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:10:58,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:10:58,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:10:58,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68e1abf4-6ddb-4db7-91a6-a8d63c464265/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:10:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:10:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:10:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:10:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:10:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:10:58,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:10:58,832 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:10:58,832 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:10:58,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:10:58 BoogieIcfgContainer [2019-11-15 23:10:58,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:10:58,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:10:58,834 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:10:58,837 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:10:58,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:10:58,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:10:57" (1/3) ... [2019-11-15 23:10:58,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bf3c465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:10:58, skipping insertion in model container [2019-11-15 23:10:58,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:10:58,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:10:58" (2/3) ... [2019-11-15 23:10:58,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bf3c465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:10:58, skipping insertion in model container [2019-11-15 23:10:58,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:10:58,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:10:58" (3/3) ... [2019-11-15 23:10:58,842 INFO L371 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2019-11-15 23:10:58,883 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:10:58,883 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:10:58,883 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:10:58,884 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:10:58,884 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:10:58,884 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:10:58,884 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:10:58,884 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:10:58,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:10:58,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:10:58,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:58,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:58,924 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:10:58,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:10:58,924 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:10:58,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:10:58,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:10:58,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:58,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:58,927 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:10:58,927 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:10:58,934 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 10#L558-2true [2019-11-15 23:10:58,935 INFO L793 eck$LassoCheckResult]: Loop: 10#L558-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 8#L552-1true assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L553true assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 9#L553-2true call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 5#L558true assume 0 != main_#t~mem10;havoc main_#t~mem10;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 10#L558-2true [2019-11-15 23:10:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:10:58,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:58,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290071650] [2019-11-15 23:10:58,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:58,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:58,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,076 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2019-11-15 23:10:59,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:59,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087866735] [2019-11-15 23:10:59,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2019-11-15 23:10:59,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:59,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115185202] [2019-11-15 23:10:59,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:59,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115185202] [2019-11-15 23:10:59,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:10:59,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:10:59,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506400617] [2019-11-15 23:10:59,583 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-15 23:10:59,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:59,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:10:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:10:59,607 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-11-15 23:10:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:59,710 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-15 23:10:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:10:59,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-15 23:10:59,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:10:59,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-11-15 23:10:59,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:10:59,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:10:59,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-15 23:10:59,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:10:59,718 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:10:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-15 23:10:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 23:10:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:10:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-15 23:10:59,744 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:10:59,744 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:10:59,745 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:10:59,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-15 23:10:59,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:10:59,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:59,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:59,746 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:10:59,746 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:10:59,747 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 37#L558-2 [2019-11-15 23:10:59,747 INFO L793 eck$LassoCheckResult]: Loop: 37#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 42#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 38#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 39#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 40#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 37#L558-2 [2019-11-15 23:10:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 23:10:59,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:59,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503733] [2019-11-15 23:10:59,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2019-11-15 23:10:59,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:59,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813286476] [2019-11-15 23:10:59,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,796 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2019-11-15 23:10:59,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:59,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466782519] [2019-11-15 23:10:59,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:59,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:59,852 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:11:00,030 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-11-15 23:11:00,211 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-15 23:11:00,310 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:11:00,310 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:11:00,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:11:00,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:11:00,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:11:00,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:11:00,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:11:00,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:11:00,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration2_Lasso [2019-11-15 23:11:00,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:11:00,312 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:11:00,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:00,594 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-15 23:11:00,711 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-15 23:11:01,279 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:11:01,320 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:11:01,325 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:11:01,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,340 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,341 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,341 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,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-11-15 23:11:01,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,353 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,353 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,360 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,360 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,364 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,365 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,370 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,370 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,375 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,376 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,376 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,381 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,381 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,386 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,387 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:01,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:01,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:01,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,398 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,399 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,413 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,413 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,468 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:11:01,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,472 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:11:01,472 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,494 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,494 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,495 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,495 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:01,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:01,500 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:01,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:01,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:01,500 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:01,502 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:01,502 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:01,520 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:11:01,533 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:11:01,534 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:11:01,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:11:01,537 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:11:01,537 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:11:01,538 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 Supporting invariants [] [2019-11-15 23:11:01,574 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:11:01,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:11:01,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:01,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:11:01,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:01,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:11:01,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:01,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-15 23:11:01,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:01,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:01,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:01,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:17 [2019-11-15 23:11:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:01,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:11:01,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-15 23:11:01,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 18 states and 21 transitions. Complement of second has 9 states. [2019-11-15 23:11:01,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:11:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:11:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-11-15 23:11:01,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2019-11-15 23:11:01,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:11:01,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-15 23:11:01,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:11:01,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2019-11-15 23:11:01,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:11:01,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-15 23:11:01,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:11:01,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-11-15 23:11:01,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:11:01,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:11:01,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-15 23:11:01,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:11:01,786 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 23:11:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-15 23:11:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 23:11:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:11:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 23:11:01,788 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 23:11:01,788 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 23:11:01,789 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:11:01,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 23:11:01,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:11:01,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:11:01,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:11:01,793 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:11:01,793 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:11:01,793 INFO L791 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 155#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 156#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 166#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 157#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8; 158#L553-2 [2019-11-15 23:11:01,793 INFO L793 eck$LassoCheckResult]: Loop: 158#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 168#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 171#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 170#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 169#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 158#L553-2 [2019-11-15 23:11:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:01,794 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-15 23:11:01,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:01,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087477416] [2019-11-15 23:11:01,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:01,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:01,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:01,844 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:11:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2019-11-15 23:11:01,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:01,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060824466] [2019-11-15 23:11:01,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:01,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:01,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:01,880 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:11:01,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2019-11-15 23:11:01,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:01,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028568541] [2019-11-15 23:11:01,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:01,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:01,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:01,913 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:11:02,290 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-11-15 23:11:02,578 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-15 23:11:02,580 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:11:02,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:11:02,581 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:11:02,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:11:02,581 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:11:02,581 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:11:02,581 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:11:02,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:11:02,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration3_Lasso [2019-11-15 23:11:02,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:11:02,581 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:11:02,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,774 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-15 23:11:02,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,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-11-15 23:11:02,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:02,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:11:03,356 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:11:03,386 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:11:03,386 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:11:03,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,387 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:03,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,388 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:03,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:03,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:03,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:03,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:03,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:03,392 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:03,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:03,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:03,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,394 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:03,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:03,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:11:03,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:11:03,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:11:03,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,403 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:03,403 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:03,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,419 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:03,419 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:03,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:03,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:03,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,434 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:03,434 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:03,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:03,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:03,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:11:03,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:11:03,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:11:03,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:11:03,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:11:03,441 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:11:03,443 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:11:03,443 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:11:03,453 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:11:03,458 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:11:03,458 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:11:03,459 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:11:03,460 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:11:03,460 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:11:03,460 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 Supporting invariants [] [2019-11-15 23:11:03,485 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:11:03,487 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:11:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:11:03,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:11:03,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:03,556 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:11:03,556 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 23:11:03,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2019-11-15 23:11:03,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:11:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:11:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-15 23:11:03,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-15 23:11:03,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:11:03,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-15 23:11:03,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:11:03,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 23:11:03,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:11:03,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-11-15 23:11:03,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:11:03,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-11-15 23:11:03,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:11:03,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:11:03,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-11-15 23:11:03,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:11:03,592 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 23:11:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-11-15 23:11:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 23:11:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 23:11:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-15 23:11:03,595 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 23:11:03,595 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 23:11:03,595 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:11:03,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-15 23:11:03,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:11:03,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:11:03,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:11:03,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-11-15 23:11:03,598 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:11:03,598 INFO L791 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 302#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 319#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 303#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8; 304#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 318#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 322#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 321#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 320#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8; 315#L553-2 [2019-11-15 23:11:03,598 INFO L793 eck$LassoCheckResult]: Loop: 315#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 307#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 308#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 312#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 313#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 315#L553-2 [2019-11-15 23:11:03,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2019-11-15 23:11:03,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:03,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9584345] [2019-11-15 23:11:03,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:03,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9584345] [2019-11-15 23:11:03,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:11:03,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:11:03,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895753072] [2019-11-15 23:11:03,692 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:11:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2019-11-15 23:11:03,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:03,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884368439] [2019-11-15 23:11:03,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:03,706 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:11:03,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:11:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:11:03,829 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-11-15 23:11:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:03,876 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-15 23:11:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:11:03,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-11-15 23:11:03,878 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:11:03,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-11-15 23:11:03,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:11:03,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:11:03,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:11:03,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:11:03,879 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:11:03,879 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:11:03,879 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:11:03,879 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:11:03,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:11:03,879 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:11:03,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:11:03,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:11:03 BoogieIcfgContainer [2019-11-15 23:11:03,886 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:11:03,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:11:03,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:11:03,887 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:11:03,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:10:58" (3/4) ... [2019-11-15 23:11:03,890 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:11:03,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:11:03,892 INFO L168 Benchmark]: Toolchain (without parser) took 6001.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -117.8 MB). Peak memory consumption was 70.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:03,892 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:11:03,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:03,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:11:03,894 INFO L168 Benchmark]: Boogie Preprocessor took 53.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:11:03,894 INFO L168 Benchmark]: RCFGBuilder took 346.59 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:03,895 INFO L168 Benchmark]: BuchiAutomizer took 5052.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:03,896 INFO L168 Benchmark]: Witness Printer took 4.17 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: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:03,899 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 346.59 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5052.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 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: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 20 SDslu, 20 SDs, 0 SdLazy, 71 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital251 mio100 ax107 hnf100 lsp89 ukn59 mio100 lsp37 div161 bol100 ite100 ukn100 eq155 hnf70 smp94 dnf158 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...