./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54e32ac14491e98c150c8fd937f55676029a26c7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:09:02,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:09:02,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:09:02,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:09:02,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:09:02,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:09:02,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:09:02,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:09:02,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:09:02,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:09:02,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:09:02,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:09:02,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:09:02,866 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:09:02,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:09:02,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:09:02,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:09:02,869 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:09:02,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:09:02,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:09:02,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:09:02,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:09:02,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:09:02,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:09:02,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:09:02,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:09:02,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:09:02,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:09:02,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:09:02,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:09:02,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:09:02,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:09:02,879 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:09:02,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:09:02,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:09:02,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:09:02,881 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:09:02,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:09:02,893 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:09:02,894 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:09:02,894 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:09:02,894 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:09:02,894 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:09:02,894 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:09:02,894 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:09:02,894 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:09:02,895 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:09:02,895 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:09:02,895 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:09:02,895 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:09:02,895 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:09:02,895 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:09:02,895 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:09:02,896 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:09:02,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:09:02,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:09:02,897 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:09:02,897 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:09:02,897 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:09:02,897 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:09:02,898 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:09:02,898 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54e32ac14491e98c150c8fd937f55676029a26c7 [2018-11-10 10:09:02,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:09:02,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:09:02,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:09:02,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:09:02,931 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:09:02,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-10 10:09:02,970 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/data/a757baab8/93a7184957bb490483f36a463e3ecd7d/FLAGcff4b5e21 [2018-11-10 10:09:03,304 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:09:03,304 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-10 10:09:03,309 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/data/a757baab8/93a7184957bb490483f36a463e3ecd7d/FLAGcff4b5e21 [2018-11-10 10:09:03,320 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/data/a757baab8/93a7184957bb490483f36a463e3ecd7d [2018-11-10 10:09:03,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:09:03,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:09:03,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:09:03,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:09:03,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:09:03,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dabe3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03, skipping insertion in model container [2018-11-10 10:09:03,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:09:03,353 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:09:03,474 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:09:03,476 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:09:03,488 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:09:03,500 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:09:03,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03 WrapperNode [2018-11-10 10:09:03,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:09:03,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:09:03,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:09:03,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:09:03,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:09:03,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:09:03,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:09:03,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:09:03,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... [2018-11-10 10:09:03,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:09:03,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:09:03,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:09:03,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:09:03,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/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 [2018-11-10 10:09:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:09:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:09:03,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:09:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:09:03,747 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:09:03,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:09:03 BoogieIcfgContainer [2018-11-10 10:09:03,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:09:03,748 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:09:03,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:09:03,752 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:09:03,752 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:09:03,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:09:03" (1/3) ... [2018-11-10 10:09:03,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38987660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:09:03, skipping insertion in model container [2018-11-10 10:09:03,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:09:03,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:09:03" (2/3) ... [2018-11-10 10:09:03,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38987660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:09:03, skipping insertion in model container [2018-11-10 10:09:03,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:09:03,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:09:03" (3/3) ... [2018-11-10 10:09:03,755 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-10 10:09:03,801 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:09:03,801 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:09:03,802 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:09:03,802 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:09:03,802 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:09:03,802 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:09:03,802 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:09:03,802 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:09:03,802 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:09:03,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 10:09:03,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 10:09:03,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:09:03,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:09:03,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:09:03,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:09:03,842 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:09:03,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 10:09:03,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 10:09:03,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:09:03,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:09:03,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:09:03,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:09:03,850 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0 := 0; 23#L7-3true [2018-11-10 10:09:03,850 INFO L795 eck$LassoCheckResult]: Loop: 23#L7-3true assume true; 4#L7-1true assume !!(main_~i~0 < 100000); 10#L9true SUMMARY for call write~int(10, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L9 8#L9-1true main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 23#L7-3true [2018-11-10 10:09:03,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 10:09:03,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:09:03,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:09:03,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:03,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:03,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:03,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1113224, now seen corresponding path program 1 times [2018-11-10 10:09:03,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:09:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:09:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:03,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash 889540426, now seen corresponding path program 1 times [2018-11-10 10:09:03,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:09:03,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:09:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:03,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:04,115 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:09:04,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:09:04,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:09:04,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:09:04,116 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:09:04,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:09:04,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:09:04,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:09:04,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 10:09:04,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:09:04,117 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:09:04,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:09:04,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:09:04,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:09:04,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:09:04,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:09:04,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:09:04,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:09:04,469 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:09:04,474 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:09:04,476 INFO L122 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 [2018-11-10 10:09:04,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:09:04,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:09:04,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:09:04,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,482 INFO L122 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 [2018-11-10 10:09:04,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:09:04,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:09:04,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:09:04,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,485 INFO L122 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 [2018-11-10 10:09:04,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:09:04,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:09:04,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,494 INFO L122 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 [2018-11-10 10:09:04,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:09:04,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:09:04,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:09:04,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,497 INFO L122 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 [2018-11-10 10:09:04,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:09:04,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:09:04,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,508 INFO L122 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 [2018-11-10 10:09:04,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:09:04,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:09:04,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,520 INFO L122 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 [2018-11-10 10:09:04,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:09:04,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,524 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:09:04,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:09:04,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,544 INFO L122 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 [2018-11-10 10:09:04,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:09:04,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:09:04,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,556 INFO L122 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 [2018-11-10 10:09:04,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:09:04,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:09:04,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:09:04,564 INFO L122 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 [2018-11-10 10:09:04,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:09:04,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:09:04,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:09:04,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:09:04,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:09:04,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:09:04,606 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:09:04,662 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-10 10:09:04,662 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 10:09:04,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:09:04,666 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:09:04,666 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:09:04,667 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1, ULTIMATE.start_main_~i~0) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 - 8*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 10:09:04,686 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 10:09:04,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 10:09:04,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:04,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:09:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:04,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:09:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:04,786 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 [2018-11-10 10:09:04,787 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 5 states. [2018-11-10 10:09:04,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 5 states. Result 41 states and 51 transitions. Complement of second has 10 states. [2018-11-10 10:09:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 10:09:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 10:09:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 10:09:04,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-10 10:09:04,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:09:04,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-10 10:09:04,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:09:04,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-10 10:09:04,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:09:04,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2018-11-10 10:09:04,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 10:09:04,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 19 states and 23 transitions. [2018-11-10 10:09:04,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 10:09:04,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 10:09:04,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-10 10:09:04,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:09:04,840 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 10:09:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-10 10:09:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 10:09:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 10:09:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-10 10:09:04,857 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 10:09:04,858 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 10:09:04,858 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:09:04,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-10 10:09:04,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 10:09:04,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:09:04,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:09:04,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:09:04,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:09:04,859 INFO L793 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0 := 0; 135#L7-3 assume true; 126#L7-1 assume !(main_~i~0 < 100000); 127#L7-4 main_~i~0 := 0; 130#L11-4 [2018-11-10 10:09:04,859 INFO L795 eck$LassoCheckResult]: Loop: 130#L11-4 assume true; 131#L11-1 assume !!(main_~i~0 < 100000); 138#L13 SUMMARY for call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L13 141#L13-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem2 == 10 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 142#L2 assume !(__VERIFIER_assert_~cond == 0); 136#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 137#L14 assume !(main_~i~0 + 1 != 15000); 125#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 130#L11-4 [2018-11-10 10:09:04,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:04,860 INFO L82 PathProgramCache]: Analyzing trace with hash 28694796, now seen corresponding path program 1 times [2018-11-10 10:09:04,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:09:04,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:09:04,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:04,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:04,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:04,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:09:04,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:09:04,885 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:09:04,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1196938891, now seen corresponding path program 1 times [2018-11-10 10:09:04,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:09:04,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:09:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:09:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:09:04,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:09:04,994 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-10 10:09:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:09:05,027 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-10 10:09:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:09:05,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-10 10:09:05,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 10:09:05,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 30 states and 32 transitions. [2018-11-10 10:09:05,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 10:09:05,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 10:09:05,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-11-10 10:09:05,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:09:05,030 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 10:09:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-11-10 10:09:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-11-10 10:09:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 10:09:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-10 10:09:05,032 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 10:09:05,033 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 10:09:05,033 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:09:05,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2018-11-10 10:09:05,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 10:09:05,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:09:05,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:09:05,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:09:05,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:09:05,034 INFO L793 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0 := 0; 194#L7-3 assume true; 186#L7-1 assume !!(main_~i~0 < 100000); 187#L9 SUMMARY for call write~int(10, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L9 190#L9-1 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 191#L7-3 assume true; 184#L7-1 assume !(main_~i~0 < 100000); 185#L7-4 main_~i~0 := 0; 188#L11-4 assume true; 189#L11-1 assume !!(main_~i~0 < 100000); 197#L13 SUMMARY for call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L13 203#L13-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem2 == 10 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 201#L2 assume !(__VERIFIER_assert_~cond == 0); 202#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 204#L14 assume main_~i~0 + 1 != 15000; 182#L15 [2018-11-10 10:09:05,035 INFO L795 eck$LassoCheckResult]: Loop: 182#L15 SUMMARY for call write~int(20, main_~#a~0.base, main_~#a~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L15 183#L11-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 192#L11-4 assume true; 206#L11-1 assume !!(main_~i~0 < 100000); 205#L13 SUMMARY for call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L13 199#L13-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem2 == 10 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 200#L2 assume !(__VERIFIER_assert_~cond == 0); 195#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem2; 196#L14 assume main_~i~0 + 1 != 15000; 182#L15 [2018-11-10 10:09:05,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 158608732, now seen corresponding path program 1 times [2018-11-10 10:09:05,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:09:05,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:09:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:05,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:05,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:09:05,071 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a80fe6c-a4c2-48e9-97c4-4e82f2dbce6c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:09:05,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:05,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:09:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:05,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:09:05,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 10:09:05,121 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:09:05,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:05,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1385302916, now seen corresponding path program 1 times [2018-11-10 10:09:05,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:09:05,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:09:05,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:05,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:05,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:09:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:05,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:09:05,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:09:05,164 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:09:05,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:09:05,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:09:05,165 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 10:09:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:09:05,218 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-10 10:09:05,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:09:05,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 23 transitions. [2018-11-10 10:09:05,219 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:09:05,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2018-11-10 10:09:05,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:09:05,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:09:05,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:09:05,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:09:05,220 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:09:05,220 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:09:05,221 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:09:05,221 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:09:05,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:09:05,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:09:05,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:09:05,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:09:05 BoogieIcfgContainer [2018-11-10 10:09:05,227 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:09:05,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:09:05,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:09:05,228 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:09:05,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:09:03" (3/4) ... [2018-11-10 10:09:05,232 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:09:05,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:09:05,233 INFO L168 Benchmark]: Toolchain (without parser) took 1909.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 960.2 MB in the beginning and 922.3 MB in the end (delta: 37.9 MB). Peak memory consumption was 170.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:09:05,234 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:09:05,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.05 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:09:05,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.69 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:09:05,236 INFO L168 Benchmark]: Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:09:05,236 INFO L168 Benchmark]: RCFGBuilder took 207.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:09:05,237 INFO L168 Benchmark]: BuchiAutomizer took 1479.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.3 MB in the end (delta: 189.4 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:09:05,238 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.2 GB. Free memory is still 922.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:09:05,241 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.05 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.69 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 207.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1479.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.3 MB in the end (delta: 189.4 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.2 GB. Free memory is still 922.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 18 SDslu, 51 SDs, 0 SdLazy, 69 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp93 ukn96 mio100 lsp51 div100 bol100 ite100 ukn100 eq173 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...