./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/mult_array-alloca-2.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_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/mult_array-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/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 23c47ba60fd5b5d47afa1439cbedebaab58a1798 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:06:57,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:06:57,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:06:57,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:06:57,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:06:57,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:06:57,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:06:57,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:06:57,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:06:57,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:06:57,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:06:57,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:06:57,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:06:57,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:06:57,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:06:57,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:06:57,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:06:57,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:06:57,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:06:57,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:06:57,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:06:57,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:06:57,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:06:57,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:06:57,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:06:57,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:06:57,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:06:57,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:06:57,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:06:57,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:06:57,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:06:57,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:06:57,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:06:57,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:06:57,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:06:57,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:06:57,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:06:57,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:06:57,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:06:57,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:06:57,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:06:57,897 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:06:57,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:06:57,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:06:57,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:06:57,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:06:57,915 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:06:57,915 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:06:57,915 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:06:57,915 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:06:57,916 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:06:57,916 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:06:57,916 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:06:57,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:06:57,916 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:06:57,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:06:57,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:06:57,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:06:57,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:06:57,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:06:57,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:06:57,918 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:06:57,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:06:57,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:06:57,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:06:57,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:06:57,919 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:06:57,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:06:57,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:06:57,920 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:06:57,920 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:06:57,921 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_45d443a5-6a47-4749-bdda-77b2938991ef/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 -> 23c47ba60fd5b5d47afa1439cbedebaab58a1798 [2019-11-15 23:06:57,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:06:57,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:06:57,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:06:57,960 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:06:57,960 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:06:57,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/mult_array-alloca-2.i [2019-11-15 23:06:58,022 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/data/cc920eb3c/bcc63fa8aa0e44439a959f2b5da4b35f/FLAGea8e14e68 [2019-11-15 23:06:58,529 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:06:58,529 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/sv-benchmarks/c/termination-memory-alloca/mult_array-alloca-2.i [2019-11-15 23:06:58,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/data/cc920eb3c/bcc63fa8aa0e44439a959f2b5da4b35f/FLAGea8e14e68 [2019-11-15 23:06:58,982 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/data/cc920eb3c/bcc63fa8aa0e44439a959f2b5da4b35f [2019-11-15 23:06:58,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:06:58,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:06:58,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:06:58,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:06:58,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:06:58,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:06:58" (1/1) ... [2019-11-15 23:06:58,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269ec081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:58, skipping insertion in model container [2019-11-15 23:06:58,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:06:58" (1/1) ... [2019-11-15 23:06:59,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:06:59,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:06:59,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:06:59,377 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:06:59,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:06:59,508 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:06:59,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59 WrapperNode [2019-11-15 23:06:59,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:06:59,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:06:59,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:06:59,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:06:59,517 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:06:59" (1/1) ... [2019-11-15 23:06:59,536 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:06:59" (1/1) ... [2019-11-15 23:06:59,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:06:59,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:06:59,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:06:59,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:06:59,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... [2019-11-15 23:06:59,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... [2019-11-15 23:06:59,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... [2019-11-15 23:06:59,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... [2019-11-15 23:06:59,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... [2019-11-15 23:06:59,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... [2019-11-15 23:06:59,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... [2019-11-15 23:06:59,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:06:59,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:06:59,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:06:59,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:06:59,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/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:06:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:06:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:06:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:06:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:06:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:06:59,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:06:59,919 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:06:59,920 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:06:59,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:59 BoogieIcfgContainer [2019-11-15 23:06:59,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:06:59,921 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:06:59,921 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:06:59,924 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:06:59,926 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:06:59,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:06:58" (1/3) ... [2019-11-15 23:06:59,927 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74ed6b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:06:59, skipping insertion in model container [2019-11-15 23:06:59,927 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:06:59,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:59" (2/3) ... [2019-11-15 23:06:59,927 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74ed6b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:06:59, skipping insertion in model container [2019-11-15 23:06:59,927 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:06:59,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:59" (3/3) ... [2019-11-15 23:06:59,929 INFO L371 chiAutomizerObserver]: Analyzing ICFG mult_array-alloca-2.i [2019-11-15 23:06:59,972 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:06:59,972 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:06:59,972 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:06:59,972 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:06:59,972 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:06:59,972 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:06:59,973 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:06:59,973 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:06:59,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:06:59,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:07:00,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:07:00,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:07:00,004 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:07:00,004 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:07:00,005 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:07:00,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:07:00,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:07:00,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:07:00,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:07:00,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:07:00,007 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:07:00,012 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_#t~mem9, main_#t~post8, main_~i~0, main_~j~0, main_~length~0, main_~fac~0, main_~arr~0.base, main_~arr~0.offset, main_~arr2~0.base, main_~arr2~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 16#L550true assume !(main_~length~0 < 1); 3#L550-2true main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 12#L552true assume !(main_~fac~0 < 1); 17#L552-2true call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 6#L555true assume !((main_~arr~0.base == 0 && main_~arr~0.offset == 0) || (main_~arr2~0.base == 0 && main_~arr2~0.offset == 0));main_~i~0 := 0; 10#L556-3true [2019-11-15 23:07:00,012 INFO L793 eck$LassoCheckResult]: Loop: 10#L556-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet7, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet7; 8#L556-2true main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 10#L556-3true [2019-11-15 23:07:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815374, now seen corresponding path program 1 times [2019-11-15 23:07:00,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:00,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677750770] [2019-11-15 23:07:00,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:00,091 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:07:00,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137975304] [2019-11-15 23:07:00,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:07:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,184 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:00,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-11-15 23:07:00,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:00,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026810890] [2019-11-15 23:07:00,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787760, now seen corresponding path program 1 times [2019-11-15 23:07:00,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:00,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577759] [2019-11-15 23:07:00,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:00,223 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:07:00,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745321318] [2019-11-15 23:07:00,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:07:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,300 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:00,558 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-15 23:07:00,672 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:07:00,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:07:00,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:07:00,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:07:00,673 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:07:00,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:07:00,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:07:00,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:07:00,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca-2.i_Iteration1_Lasso [2019-11-15 23:07:00,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:07:00,674 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:07:00,711 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:07:00,859 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 23:07:00,891 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:07:00,893 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:07:00,896 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:07:00,898 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:07:00,901 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:07:00,908 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:07:00,912 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:07:00,915 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:07:00,917 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:07:00,920 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:07:00,923 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:07:00,926 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:07:00,932 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:07:01,389 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:07:01,452 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:07:01,458 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:07:01,461 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:07:01,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:01,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:01,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:01,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:01,479 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:01,479 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:01,664 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:07:01,769 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:07:01,772 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:07:01,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:07:01,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:07:01,779 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:07:01,780 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-15 23:07:01,809 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:07:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:01,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:07:01,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:01,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:07:01,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:01,897 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:07:01,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:07:01,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-15 23:07:01,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 35 states and 46 transitions. Complement of second has 7 states. [2019-11-15 23:07:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:07:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:07:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-11-15 23:07:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 23:07:02,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:02,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 23:07:02,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:02,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 23:07:02,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:02,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-11-15 23:07:02,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:07:02,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 17 transitions. [2019-11-15 23:07:02,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:07:02,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:07:02,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 23:07:02,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:07:02,019 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:07:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 23:07:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 23:07:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:07:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 23:07:02,048 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:07:02,048 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:07:02,048 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:07:02,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 23:07:02,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:07:02,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:07:02,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:07:02,050 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:07:02,050 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:07:02,051 INFO L791 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_#t~mem9, main_#t~post8, main_~i~0, main_~j~0, main_~length~0, main_~fac~0, main_~arr~0.base, main_~arr~0.offset, main_~arr2~0.base, main_~arr2~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 130#L550 assume !(main_~length~0 < 1); 131#L550-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 132#L552 assume !(main_~fac~0 < 1); 139#L552-2 call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 141#L555 assume !((main_~arr~0.base == 0 && main_~arr~0.offset == 0) || (main_~arr2~0.base == 0 && main_~arr2~0.offset == 0));main_~i~0 := 0; 133#L556-3 assume !(main_~i~0 < main_~length~0); 134#L556-4 main_~j~0 := 0; 138#L559-3 [2019-11-15 23:07:02,051 INFO L793 eck$LassoCheckResult]: Loop: 138#L559-3 assume !!(main_~j~0 < main_~length~0 * main_~fac~0);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (if main_~i~0 < 0 && 0 != main_~i~0 % main_~length~0 then (if main_~length~0 < 0 then main_~i~0 % main_~length~0 + main_~length~0 else main_~i~0 % main_~length~0 - main_~length~0) else main_~i~0 % main_~length~0), 4);call write~int(main_#t~mem9, main_~arr2~0.base, main_~arr2~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem9; 140#L559-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 138#L559-3 [2019-11-15 23:07:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1182787702, now seen corresponding path program 1 times [2019-11-15 23:07:02,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:02,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062901218] [2019-11-15 23:07:02,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:02,066 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:07:02,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614137830] [2019-11-15 23:07:02,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:07:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:02,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:07:02,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:02,167 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:07:02,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062901218] [2019-11-15 23:07:02,173 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:07:02,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614137830] [2019-11-15 23:07:02,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:07:02,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:07:02,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605736557] [2019-11-15 23:07:02,177 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:07:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2019-11-15 23:07:02,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:02,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882157669] [2019-11-15 23:07:02,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:02,182 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:07:02,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210214505] [2019-11-15 23:07:02,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:07:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:02,228 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:02,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:07:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:07:02,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:07:02,323 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 23:07:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:07:02,355 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-15 23:07:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:07:02,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-15 23:07:02,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:07:02,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2019-11-15 23:07:02,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:07:02,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:07:02,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-15 23:07:02,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:07:02,359 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 23:07:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-15 23:07:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-15 23:07:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:07:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-15 23:07:02,361 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 23:07:02,361 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 23:07:02,361 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:07:02,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-15 23:07:02,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:07:02,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:07:02,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:07:02,362 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:07:02,362 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:07:02,363 INFO L791 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_#t~mem9, main_#t~post8, main_~i~0, main_~j~0, main_~length~0, main_~fac~0, main_~arr~0.base, main_~arr~0.offset, main_~arr2~0.base, main_~arr2~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 188#L550 assume !(main_~length~0 < 1); 189#L550-2 main_~fac~0 := main_#t~nondet3;havoc main_#t~nondet3; 190#L552 assume !(main_~fac~0 < 1); 196#L552-2 call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * (main_~fac~0 * main_~length~0));main_~arr2~0.base, main_~arr2~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 199#L555 assume !((main_~arr~0.base == 0 && main_~arr~0.offset == 0) || (main_~arr2~0.base == 0 && main_~arr2~0.offset == 0));main_~i~0 := 0; 191#L556-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet7, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet7; 192#L556-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 193#L556-3 assume !(main_~i~0 < main_~length~0); 194#L556-4 main_~j~0 := 0; 197#L559-3 [2019-11-15 23:07:02,363 INFO L793 eck$LassoCheckResult]: Loop: 197#L559-3 assume !!(main_~j~0 < main_~length~0 * main_~fac~0);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (if main_~i~0 < 0 && 0 != main_~i~0 % main_~length~0 then (if main_~length~0 < 0 then main_~i~0 % main_~length~0 + main_~length~0 else main_~i~0 % main_~length~0 - main_~length~0) else main_~i~0 % main_~length~0), 4);call write~int(main_#t~mem9, main_~arr2~0.base, main_~arr2~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem9; 198#L559-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 197#L559-3 [2019-11-15 23:07:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1507295208, now seen corresponding path program 1 times [2019-11-15 23:07:02,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:02,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711041380] [2019-11-15 23:07:02,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:02,368 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:07:02,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339573346] [2019-11-15 23:07:02,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:07:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:02,430 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 2 times [2019-11-15 23:07:02,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:02,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677215603] [2019-11-15 23:07:02,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:02,434 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:07:02,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583437960] [2019-11-15 23:07:02,435 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:07:02,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 23:07:02,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-15 23:07:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:02,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:02,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1106714758, now seen corresponding path program 1 times [2019-11-15 23:07:02,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:02,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389884200] [2019-11-15 23:07:02,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:02,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:02,490 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:07:02,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987413972] [2019-11-15 23:07:02,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45d443a5-6a47-4749-bdda-77b2938991ef/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:07:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:02,557 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:02,909 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-11-15 23:07:03,005 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:07:03,005 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:07:03,005 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:07:03,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:07:03,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:07:03,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:07:03,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:07:03,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:07:03,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca-2.i_Iteration3_Lasso [2019-11-15 23:07:03,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:07:03,006 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:07:03,011 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:07:03,017 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:07:03,019 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:07:03,021 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:07:03,023 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:07:03,025 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:07:03,028 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:07:03,030 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:07:03,033 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:07:03,516 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-11-15 23:07:03,647 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-11-15 23:07:03,647 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:07:03,649 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:07:03,651 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:07:03,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:07:03,853 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-15 23:07:04,167 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2019-11-15 23:07:04,483 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 23:07:04,591 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:07:04,647 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:07:04,648 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:07:04,648 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:07:04,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:07:04,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:07:04,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:07:04,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,652 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:07:04,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:07:04,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:07:04,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:07:04,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,654 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:07:04,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:07:04,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,656 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:07:04,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:07:04,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,657 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:07:04,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:07:04,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:07:04,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:07:04,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,660 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:07:04,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:07:04,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:07:04,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:07:04,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,663 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:07:04,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:04,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:04,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,668 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:07:04,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,669 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:07:04,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:07:04,670 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:07:04,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,671 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:07:04,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:04,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:04,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,676 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:07:04,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,678 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:04,679 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:04,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,687 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:07:04,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:07:04,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:04,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:07:04,689 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:07:04,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:04,690 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:07:04,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:04,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:04,691 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:07:04,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:04,706 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 23:07:04,706 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:07:04,953 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:07:05,175 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:07:05,176 INFO L444 ModelExtractionUtils]: 57 out of 66 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:07:05,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:07:05,178 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 23:07:05,179 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:07:05,179 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1, ULTIMATE.start_main_~arr2~0.offset) = -4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1 - 1*ULTIMATE.start_main_~arr2~0.offset Supporting invariants [] [2019-11-15 23:07:05,210 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:07:05,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:07:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:05,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:07:05,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:05,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:07:05,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:05,261 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:07:05,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:07:05,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:07:05,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 15 states and 19 transitions. Complement of second has 4 states. [2019-11-15 23:07:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:07:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:07:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-15 23:07:05,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 23:07:05,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:05,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-15 23:07:05,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:05,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 23:07:05,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:05,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-15 23:07:05,277 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:07:05,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-11-15 23:07:05,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:07:05,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:07:05,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:07:05,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:07:05,278 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:07:05,278 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:07:05,278 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:07:05,278 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:07:05,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:07:05,279 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:07:05,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:07:05,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:07:05 BoogieIcfgContainer [2019-11-15 23:07:05,284 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:07:05,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:07:05,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:07:05,285 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:07:05,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:59" (3/4) ... [2019-11-15 23:07:05,288 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:07:05,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:07:05,290 INFO L168 Benchmark]: Toolchain (without parser) took 6303.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 944.7 MB in the beginning and 927.0 MB in the end (delta: 17.7 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:05,290 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:07:05,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:05,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.64 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:07:05,292 INFO L168 Benchmark]: Boogie Preprocessor took 42.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:05,293 INFO L168 Benchmark]: RCFGBuilder took 320.53 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:05,293 INFO L168 Benchmark]: BuchiAutomizer took 5362.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 927.0 MB in the end (delta: 176.5 MB). Peak memory consumption was 223.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:05,294 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 1.2 GB. Free memory is still 927.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:07:05,297 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.64 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 42.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 320.53 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5362.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 927.0 MB in the end (delta: 176.5 MB). Peak memory consumption was 223.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.19 ms. Allocated memory is still 1.2 GB. Free memory is still 927.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr2] + -1 * arr2 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 40 SDtfs, 41 SDslu, 17 SDs, 0 SdLazy, 29 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital213 mio100 ax109 hnf99 lsp86 ukn88 mio100 lsp66 div113 bol100 ite134 ukn100 eq158 hnf92 smp69 dnf129 smp97 tf100 neg96 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 489ms VariablesStem: 13 VariablesLoop: 11 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...