./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/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 a2f74ce7922c40e74e42c65aab9bfb3ac8f3d0eb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:40:06,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:40:06,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:40:06,940 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:40:06,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:40:06,941 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:40:06,942 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:40:06,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:40:06,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:40:06,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:40:06,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:40:06,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:40:06,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:40:06,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:40:06,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:40:06,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:40:06,950 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:40:06,952 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:40:06,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:40:06,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:40:06,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:40:06,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:40:06,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:40:06,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:40:06,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:40:06,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:40:06,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:40:06,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:40:06,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:40:06,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:40:06,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:40:06,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:40:06,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:40:06,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:40:06,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:40:06,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:40:06,964 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 14:40:06,975 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:40:06,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:40:06,977 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:40:06,977 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:40:06,977 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:40:06,977 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:40:06,977 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:40:06,977 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:40:06,978 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:40:06,978 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:40:06,978 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:40:06,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:40:06,978 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:40:06,978 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:40:06,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:40:06,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:40:06,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:40:06,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:40:06,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:40:06,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:40:06,979 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:40:06,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:40:06,980 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:40:06,980 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:40:06,980 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:40:06,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:40:06,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:40:06,980 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:40:06,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:40:06,981 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:40:06,981 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:40:06,982 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:40:06,982 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_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/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 -> a2f74ce7922c40e74e42c65aab9bfb3ac8f3d0eb [2018-11-23 14:40:07,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:40:07,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:40:07,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:40:07,017 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:40:07,017 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:40:07,018 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-23 14:40:07,062 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/data/b665d482e/12422873096f44eaaef6d2a2396b96e1/FLAG3522b40ca [2018-11-23 14:40:07,476 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:40:07,477 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-23 14:40:07,481 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/data/b665d482e/12422873096f44eaaef6d2a2396b96e1/FLAG3522b40ca [2018-11-23 14:40:07,490 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/data/b665d482e/12422873096f44eaaef6d2a2396b96e1 [2018-11-23 14:40:07,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:40:07,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:40:07,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:07,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:40:07,496 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:40:07,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f375ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07, skipping insertion in model container [2018-11-23 14:40:07,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:40:07,517 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:40:07,636 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:07,642 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:40:07,656 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:07,665 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:40:07,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07 WrapperNode [2018-11-23 14:40:07,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:07,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:07,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:40:07,666 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:40:07,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:07,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:40:07,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:40:07,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:40:07,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... [2018-11-23 14:40:07,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:40:07,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:40:07,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:40:07,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:40:07,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/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-23 14:40:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:40:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:40:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:40:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:40:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:40:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:40:07,993 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:40:07,993 INFO L280 CfgBuilder]: Removed 22 assue(true) statements. [2018-11-23 14:40:07,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:07 BoogieIcfgContainer [2018-11-23 14:40:07,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:40:07,994 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:40:07,994 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:40:07,997 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:40:07,998 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:40:07,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:40:07" (1/3) ... [2018-11-23 14:40:07,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ddd12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:40:07, skipping insertion in model container [2018-11-23 14:40:07,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:40:07,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:07" (2/3) ... [2018-11-23 14:40:07,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ddd12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:40:07, skipping insertion in model container [2018-11-23 14:40:07,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:40:07,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:07" (3/3) ... [2018-11-23 14:40:08,002 INFO L375 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-23 14:40:08,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:40:08,037 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:40:08,037 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:40:08,037 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:40:08,037 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:40:08,037 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:40:08,037 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:40:08,037 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:40:08,037 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:40:08,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-23 14:40:08,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2018-11-23 14:40:08,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:40:08,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:40:08,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:40:08,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:40:08,066 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:40:08,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-23 14:40:08,068 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2018-11-23 14:40:08,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:40:08,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:40:08,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:40:08,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:40:08,073 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 16#L-1true havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 28#L19-3true [2018-11-23 14:40:08,074 INFO L796 eck$LassoCheckResult]: Loop: 28#L19-3true assume !!(main_~x~0 < main_~n~0);main_~y~0 := 1 + main_~x~0; 9#L20-3true assume !(main_~y~0 < main_~n~0); 30#L19-2true main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 28#L19-3true [2018-11-23 14:40:08,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 14:40:08,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:08,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash 39930, now seen corresponding path program 1 times [2018-11-23 14:40:08,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:08,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28698872, now seen corresponding path program 1 times [2018-11-23 14:40:08,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:08,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:08,212 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-23 14:40:08,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:08,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:40:08,257 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:40:08,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:40:08,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:40:08,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:40:08,259 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 14:40:08,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:08,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:40:08,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:40:08,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration1_Loop [2018-11-23 14:40:08,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:40:08,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:40:08,276 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-23 14:40:08,293 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-23 14:40:08,340 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:40:08,341 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:08,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:40:08,344 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:08,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 14:40:08,369 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:40:08,575 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 14:40:08,576 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:40:08,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:40:08,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:40:08,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:40:08,576 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:40:08,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:08,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:40:08,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:40:08,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration1_Loop [2018-11-23 14:40:08,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:40:08,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:40:08,577 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-23 14:40:08,590 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-23 14:40:08,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:40:08,617 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:40:08,618 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-23 14:40:08,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:08,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:08,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:08,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:08,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:08,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:08,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:08,627 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:40:08,634 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 14:40:08,635 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:40:08,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:40:08,636 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 14:40:08,636 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:40:08,637 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-23 14:40:08,637 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 14:40:08,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:08,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:08,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:08,687 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-23 14:40:08,700 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 [2018-11-23 14:40:08,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states. Second operand 3 states. [2018-11-23 14:40:08,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states.. Second operand 3 states. Result 105 states and 159 transitions. Complement of second has 8 states. [2018-11-23 14:40:08,764 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 [2018-11-23 14:40:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:40:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-23 14:40:08,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-23 14:40:08,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:08,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 14:40:08,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:08,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 14:40:08,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:08,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 159 transitions. [2018-11-23 14:40:08,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2018-11-23 14:40:08,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 50 states and 73 transitions. [2018-11-23 14:40:08,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 14:40:08,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-23 14:40:08,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 73 transitions. [2018-11-23 14:40:08,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:40:08,778 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 73 transitions. [2018-11-23 14:40:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 73 transitions. [2018-11-23 14:40:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-11-23 14:40:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 14:40:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2018-11-23 14:40:08,798 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 65 transitions. [2018-11-23 14:40:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:40:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:40:08,801 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand 3 states. [2018-11-23 14:40:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:08,850 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 14:40:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:40:08,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 59 transitions. [2018-11-23 14:40:08,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2018-11-23 14:40:08,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 42 states and 54 transitions. [2018-11-23 14:40:08,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 14:40:08,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 14:40:08,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2018-11-23 14:40:08,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:40:08,855 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2018-11-23 14:40:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2018-11-23 14:40:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-11-23 14:40:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 14:40:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 14:40:08,858 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 14:40:08,858 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 14:40:08,858 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:40:08,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2018-11-23 14:40:08,859 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2018-11-23 14:40:08,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:40:08,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:40:08,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 14:40:08,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:08,860 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 294#L19-3 assume !(main_~x~0 < main_~n~0); 301#L19-4 call main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc(400000);havoc main_~v~0;main_~v~0 := 0; 302#L26-3 [2018-11-23 14:40:08,860 INFO L796 eck$LassoCheckResult]: Loop: 302#L26-3 assume !!(main_~v~0 < 100000);call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);elem_exists_#in~set.base, elem_exists_#in~set.offset, elem_exists_#in~size, elem_exists_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem7;havoc elem_exists_#res;havoc elem_exists_#t~mem1, elem_exists_#t~post0, elem_exists_~set.base, elem_exists_~set.offset, elem_exists_~size, elem_exists_~value, elem_exists_~i~0;elem_exists_~set.base, elem_exists_~set.offset := elem_exists_#in~set.base, elem_exists_#in~set.offset;elem_exists_~size := elem_exists_#in~size;elem_exists_~value := elem_exists_#in~value;havoc elem_exists_~i~0;elem_exists_~i~0 := 0; 292#L9-3 assume !(elem_exists_~i~0 < elem_exists_~size); 312#L9-4 elem_exists_#res := 0; 311#L12 main_#t~ret8 := elem_exists_#res; 310#L27 assume !(0 != main_#t~ret8);havoc main_#t~ret8;havoc main_#t~mem7; 309#L27-2 main_~x~0 := 0; 308#L30-3 assume !(main_~x~0 < main_~n~0); 306#L26-2 main_#t~post6 := main_~v~0;main_~v~0 := 1 + main_#t~post6;havoc main_#t~post6; 302#L26-3 [2018-11-23 14:40:08,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash 925728, now seen corresponding path program 1 times [2018-11-23 14:40:08,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:08,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:08,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash -776885752, now seen corresponding path program 1 times [2018-11-23 14:40:08,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:08,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1709783847, now seen corresponding path program 1 times [2018-11-23 14:40:08,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:08,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:08,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:09,105 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:40:09,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:40:09,106 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:40:09,106 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:40:09,106 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:40:09,106 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:09,106 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:40:09,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:40:09,106 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration2_Lasso [2018-11-23 14:40:09,106 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:40:09,106 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:40:09,110 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-23 14:40:09,112 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-23 14:40:09,113 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-23 14:40:09,115 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-23 14:40:09,117 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-23 14:40:09,119 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-23 14:40:09,127 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-23 14:40:09,195 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-23 14:40:09,197 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-23 14:40:09,199 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-23 14:40:09,201 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-23 14:40:09,203 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-23 14:40:09,205 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-23 14:40:09,207 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-23 14:40:09,211 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-23 14:40:09,212 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-23 14:40:09,213 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-23 14:40:09,215 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-23 14:40:09,216 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-23 14:40:09,217 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-23 14:40:09,218 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-23 14:40:09,219 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-23 14:40:09,221 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-23 14:40:09,222 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-23 14:40:09,223 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-23 14:40:09,225 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-23 14:40:09,228 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-23 14:40:09,229 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-23 14:40:09,415 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:40:09,415 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:40:09,415 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-23 14:40:09,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:09,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:09,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:09,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,418 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-23 14:40:09,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:09,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:09,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:09,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,420 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-23 14:40:09,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:09,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:09,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:09,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,423 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-23 14:40:09,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:40:09,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:40:09,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,428 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-23 14:40:09,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:09,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:09,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:09,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,431 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-23 14:40:09,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:40:09,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:40:09,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,443 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-23 14:40:09,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,444 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:40:09,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,446 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:40:09,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:40:09,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,456 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-23 14:40:09,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:40:09,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:40:09,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,464 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-23 14:40:09,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:09,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:09,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:09,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:09,468 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-23 14:40:09,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:09,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:09,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:09,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:09,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:40:09,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:40:09,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:40:09,509 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 14:40:09,509 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 14:40:09,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:40:09,511 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:40:09,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:40:09,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v~0) = -2*ULTIMATE.start_main_~v~0 + 199999 Supporting invariants [] [2018-11-23 14:40:09,530 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 14:40:09,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:09,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:09,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:09,575 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-23 14:40:09,575 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:40:09,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 47 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 14:40:09,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 47 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 71 states and 94 transitions. Complement of second has 6 states. [2018-11-23 14:40:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:40:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:40:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-23 14:40:09,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-23 14:40:09,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:09,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-23 14:40:09,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:09,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-23 14:40:09,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:09,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 94 transitions. [2018-11-23 14:40:09,596 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-23 14:40:09,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 60 states and 81 transitions. [2018-11-23 14:40:09,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 14:40:09,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-23 14:40:09,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2018-11-23 14:40:09,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:40:09,597 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 81 transitions. [2018-11-23 14:40:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2018-11-23 14:40:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 14:40:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 14:40:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2018-11-23 14:40:09,603 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2018-11-23 14:40:09,603 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2018-11-23 14:40:09,603 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:40:09,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2018-11-23 14:40:09,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-23 14:40:09,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:40:09,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:40:09,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 14:40:09,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:40:09,605 INFO L794 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 485#L-1 havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 486#L19-3 assume !(main_~x~0 < main_~n~0); 493#L19-4 call main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc(400000);havoc main_~v~0;main_~v~0 := 0; 494#L26-3 assume !!(main_~v~0 < 100000);call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);elem_exists_#in~set.base, elem_exists_#in~set.offset, elem_exists_#in~size, elem_exists_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem7;havoc elem_exists_#res;havoc elem_exists_#t~mem1, elem_exists_#t~post0, elem_exists_~set.base, elem_exists_~set.offset, elem_exists_~size, elem_exists_~value, elem_exists_~i~0;elem_exists_~set.base, elem_exists_~set.offset := elem_exists_#in~set.base, elem_exists_#in~set.offset;elem_exists_~size := elem_exists_#in~size;elem_exists_~value := elem_exists_#in~value;havoc elem_exists_~i~0;elem_exists_~i~0 := 0; 473#L9-3 [2018-11-23 14:40:09,605 INFO L796 eck$LassoCheckResult]: Loop: 473#L9-3 assume !!(elem_exists_~i~0 < elem_exists_~size);call elem_exists_#t~mem1 := read~int(elem_exists_~set.base, elem_exists_~set.offset + 4 * elem_exists_~i~0, 4); 474#L10 assume !(elem_exists_#t~mem1 == elem_exists_~value);havoc elem_exists_#t~mem1; 483#L9-2 elem_exists_#t~post0 := elem_exists_~i~0;elem_exists_~i~0 := 1 + elem_exists_#t~post0;havoc elem_exists_#t~post0; 473#L9-3 [2018-11-23 14:40:09,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:09,605 INFO L82 PathProgramCache]: Analyzing trace with hash 28697613, now seen corresponding path program 1 times [2018-11-23 14:40:09,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:09,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:09,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash 82582, now seen corresponding path program 1 times [2018-11-23 14:40:09,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:09,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:09,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:09,632 INFO L82 PathProgramCache]: Analyzing trace with hash 232149770, now seen corresponding path program 1 times [2018-11-23 14:40:09,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:09,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:09,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:09,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:09,684 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-23 14:40:09,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:09,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:09,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:09,703 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-23 14:40:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:09,736 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2018-11-23 14:40:09,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:40:09,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2018-11-23 14:40:09,737 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2018-11-23 14:40:09,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 100 transitions. [2018-11-23 14:40:09,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-23 14:40:09,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-23 14:40:09,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2018-11-23 14:40:09,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:40:09,738 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 100 transitions. [2018-11-23 14:40:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2018-11-23 14:40:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2018-11-23 14:40:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 14:40:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-11-23 14:40:09,741 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-23 14:40:09,741 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-23 14:40:09,742 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:40:09,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2018-11-23 14:40:09,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-23 14:40:09,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:40:09,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:40:09,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:09,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:40:09,743 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 634#L-1 havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 635#L19-3 assume !(main_~x~0 < main_~n~0); 646#L19-4 call main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc(400000);havoc main_~v~0;main_~v~0 := 0; 647#L26-3 assume !!(main_~v~0 < 100000);call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);elem_exists_#in~set.base, elem_exists_#in~set.offset, elem_exists_#in~size, elem_exists_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem7;havoc elem_exists_#res;havoc elem_exists_#t~mem1, elem_exists_#t~post0, elem_exists_~set.base, elem_exists_~set.offset, elem_exists_~size, elem_exists_~value, elem_exists_~i~0;elem_exists_~set.base, elem_exists_~set.offset := elem_exists_#in~set.base, elem_exists_#in~set.offset;elem_exists_~size := elem_exists_#in~size;elem_exists_~value := elem_exists_#in~value;havoc elem_exists_~i~0;elem_exists_~i~0 := 0; 621#L9-3 assume !(elem_exists_~i~0 < elem_exists_~size); 606#L9-4 elem_exists_#res := 0; 607#L12 main_#t~ret8 := elem_exists_#res; 614#L27 assume 0 != main_#t~ret8;havoc main_#t~ret8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);insert_#in~set.base, insert_#in~set.offset, insert_#in~size, insert_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem9;havoc insert_#res;havoc insert_~set.base, insert_~set.offset, insert_~size, insert_~value;insert_~set.base, insert_~set.offset := insert_#in~set.base, insert_#in~set.offset;insert_~size := insert_#in~size;insert_~value := insert_#in~value;call write~int(insert_~value, insert_~set.base, insert_~set.offset + 4 * insert_~size, 4);insert_#res := 1 + insert_~size; 610#L5 main_#t~ret10 := insert_#res;main_~n~0 := main_#t~ret10;havoc main_#t~mem9;havoc main_#t~ret10; 611#L27-2 main_~x~0 := 0; 644#L30-3 [2018-11-23 14:40:09,743 INFO L796 eck$LassoCheckResult]: Loop: 644#L30-3 assume !!(main_~x~0 < main_~n~0);main_~y~0 := 1 + main_~x~0; 624#L31-3 assume !(main_~y~0 < main_~n~0); 625#L30-2 main_#t~post11 := main_~x~0;main_~x~0 := 1 + main_#t~post11;havoc main_#t~post11; 644#L30-3 [2018-11-23 14:40:09,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1024981665, now seen corresponding path program 1 times [2018-11-23 14:40:09,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:09,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:09,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:09,767 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-23 14:40:09,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:09,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:09,768 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:40:09,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 112419, now seen corresponding path program 1 times [2018-11-23 14:40:09,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:09,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:09,784 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:40:09,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:40:09,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:40:09,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:40:09,784 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 14:40:09,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:09,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:40:09,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:40:09,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration4_Loop [2018-11-23 14:40:09,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:40:09,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:40:09,785 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-23 14:40:09,786 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-23 14:40:09,813 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:40:09,813 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:09,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:40:09,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:40:09,818 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 14:40:09,818 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post11=0} Honda state: {ULTIMATE.start_main_#t~post11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:09,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 14:40:09,833 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_daa9b194-fa91-47bd-ab9f-a820f66e5a6c/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:09,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 14:40:09,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 14:40:10,066 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 14:40:10,067 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:40:10,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:40:10,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:40:10,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:40:10,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:40:10,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:40:10,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:40:10,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:40:10,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration4_Loop [2018-11-23 14:40:10,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:40:10,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:40:10,069 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-23 14:40:10,070 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-23 14:40:10,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:40:10,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:40:10,102 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-23 14:40:10,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:10,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:10,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:10,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:10,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:10,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:10,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:10,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:40:10,104 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-23 14:40:10,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:40:10,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:40:10,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:40:10,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:40:10,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:40:10,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:40:10,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:40:10,108 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:40:10,110 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 14:40:10,110 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:40:10,111 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:40:10,111 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 14:40:10,111 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:40:10,111 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-23 14:40:10,111 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 14:40:10,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:10,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:10,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:10,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-23 14:40:10,165 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 [2018-11-23 14:40:10,165 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-23 14:40:10,211 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 153 states and 193 transitions. Complement of second has 7 states. [2018-11-23 14:40:10,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:40:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:40:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-23 14:40:10,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 14:40:10,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:10,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 14:40:10,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:10,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-23 14:40:10,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:40:10,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 193 transitions. [2018-11-23 14:40:10,215 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2018-11-23 14:40:10,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 116 states and 147 transitions. [2018-11-23 14:40:10,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 14:40:10,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-23 14:40:10,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 147 transitions. [2018-11-23 14:40:10,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:40:10,217 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 147 transitions. [2018-11-23 14:40:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 147 transitions. [2018-11-23 14:40:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2018-11-23 14:40:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 14:40:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-11-23 14:40:10,220 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 89 transitions. [2018-11-23 14:40:10,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:10,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:10,242 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 4 states. [2018-11-23 14:40:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:10,288 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 14:40:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:10,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 21 transitions. [2018-11-23 14:40:10,289 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:40:10,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-11-23 14:40:10,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 14:40:10,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 14:40:10,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 14:40:10,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:40:10,289 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:40:10,289 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:40:10,289 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:40:10,289 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:40:10,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:40:10,290 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:40:10,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 14:40:10,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:40:10 BoogieIcfgContainer [2018-11-23 14:40:10,296 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:40:10,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:40:10,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:40:10,296 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:40:10,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:07" (3/4) ... [2018-11-23 14:40:10,300 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:40:10,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:40:10,300 INFO L168 Benchmark]: Toolchain (without parser) took 2807.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -234.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:10,302 INFO L168 Benchmark]: CDTParser took 0.16 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-23 14:40:10,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.41 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:10,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:10,303 INFO L168 Benchmark]: Boogie Preprocessor took 22.76 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:10,304 INFO L168 Benchmark]: RCFGBuilder took 238.77 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:10,304 INFO L168 Benchmark]: BuchiAutomizer took 2301.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:10,304 INFO L168 Benchmark]: Witness Printer took 3.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:10,307 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.16 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 172.41 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.76 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 238.77 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2301.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + n and consists of 5 locations. One deterministic module has affine ranking function -2 * v + 199999 and consists of 4 locations. One deterministic module has affine ranking function n + -1 * x and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 58 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 149 SDtfs, 136 SDslu, 166 SDs, 0 SdLazy, 102 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT1 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital44 mio100 ax100 hnf95 lsp94 ukn93 mio100 lsp89 div100 bol100 ite100 ukn100 eq163 hnf93 smp85 dnf100 smp100 tf106 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...