./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/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_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/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-1dbac8b [2018-11-10 13:00:49,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:00:49,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:00:49,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:00:49,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:00:49,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:00:49,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:00:50,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:00:50,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:00:50,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:00:50,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:00:50,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:00:50,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:00:50,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:00:50,004 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:00:50,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:00:50,006 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:00:50,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:00:50,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:00:50,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:00:50,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:00:50,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:00:50,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:00:50,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:00:50,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:00:50,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:00:50,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:00:50,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:00:50,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:00:50,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:00:50,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:00:50,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:00:50,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:00:50,017 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:00:50,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:00:50,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:00:50,018 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 13:00:50,029 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:00:50,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:00:50,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:00:50,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:00:50,031 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:00:50,031 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:00:50,031 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:00:50,031 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:00:50,031 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:00:50,032 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:00:50,032 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:00:50,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:00:50,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:00:50,032 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:00:50,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:00:50,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:00:50,033 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:00:50,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:00:50,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:00:50,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:00:50,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:00:50,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:00:50,033 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:00:50,034 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:00:50,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:00:50,034 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:00:50,034 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:00:50,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:00:50,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:00:50,035 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:00:50,035 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:00:50,035 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_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/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-10 13:00:50,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:00:50,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:00:50,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:00:50,073 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:00:50,074 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:00:50,074 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-10 13:00:50,122 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/data/b327d235e/3b33ec3393394e5498ee4fcf98531e0f/FLAGe2c295762 [2018-11-10 13:00:50,446 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:00:50,446 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-10 13:00:50,451 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/data/b327d235e/3b33ec3393394e5498ee4fcf98531e0f/FLAGe2c295762 [2018-11-10 13:00:50,463 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/data/b327d235e/3b33ec3393394e5498ee4fcf98531e0f [2018-11-10 13:00:50,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:00:50,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:00:50,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:00:50,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:00:50,470 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:00:50,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae94ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50, skipping insertion in model container [2018-11-10 13:00:50,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:00:50,496 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:00:50,625 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:00:50,630 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:00:50,644 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:00:50,653 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:00:50,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50 WrapperNode [2018-11-10 13:00:50,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:00:50,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:00:50,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:00:50,654 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:00:50,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:00:50,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:00:50,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:00:50,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:00:50,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... [2018-11-10 13:00:50,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:00:50,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:00:50,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:00:50,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:00:50,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:00:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:00:50,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:00:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:00:50,979 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:00:50,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:50 BoogieIcfgContainer [2018-11-10 13:00:50,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:00:50,980 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:00:50,980 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:00:50,982 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:00:50,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:00:50,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:00:50" (1/3) ... [2018-11-10 13:00:50,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c289336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:00:50, skipping insertion in model container [2018-11-10 13:00:50,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:00:50,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:50" (2/3) ... [2018-11-10 13:00:50,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c289336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:00:50, skipping insertion in model container [2018-11-10 13:00:50,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:00:50,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:50" (3/3) ... [2018-11-10 13:00:50,985 INFO L375 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-10 13:00:51,030 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:00:51,031 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:00:51,031 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:00:51,031 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:00:51,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:00:51,031 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:00:51,032 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:00:51,032 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:00:51,032 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:00:51,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states. [2018-11-10 13:00:51,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2018-11-10 13:00:51,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:51,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:51,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:00:51,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 13:00:51,064 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:00:51,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states. [2018-11-10 13:00:51,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2018-11-10 13:00:51,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:51,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:51,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:00:51,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 13:00:51,070 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 14#L19-4true [2018-11-10 13:00:51,071 INFO L795 eck$LassoCheckResult]: Loop: 14#L19-4true assume true; 18#L19-1true assume !!(main_~x~0 < main_~n~0);main_~y~0 := main_~x~0 + 1; 37#L20-4true assume !true; 16#L19-3true main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 + 1;havoc main_#t~post2; 14#L19-4true [2018-11-10 13:00:51,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 13:00:51,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:51,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:51,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:51,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:51,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1113992, now seen corresponding path program 1 times [2018-11-10 13:00:51,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:51,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:51,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:51,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:00:51,170 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:00:51,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:00:51,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:00:51,182 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-11-10 13:00:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:51,189 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-10 13:00:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:00:51,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2018-11-10 13:00:51,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2018-11-10 13:00:51,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 56 states and 65 transitions. [2018-11-10 13:00:51,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-10 13:00:51,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-10 13:00:51,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2018-11-10 13:00:51,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:00:51,199 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-10 13:00:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2018-11-10 13:00:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 13:00:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 13:00:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-11-10 13:00:51,219 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-10 13:00:51,219 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-10 13:00:51,219 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:00:51,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 65 transitions. [2018-11-10 13:00:51,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2018-11-10 13:00:51,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:51,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:51,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:00:51,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 13:00:51,221 INFO L793 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 137#L19-4 [2018-11-10 13:00:51,221 INFO L795 eck$LassoCheckResult]: Loop: 137#L19-4 assume true; 147#L19-1 assume !!(main_~x~0 < main_~n~0);main_~y~0 := main_~x~0 + 1; 153#L20-4 assume true; 175#L20-1 assume !(main_~y~0 < main_~n~0); 150#L19-3 main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 + 1;havoc main_#t~post2; 137#L19-4 [2018-11-10 13:00:51,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 13:00:51,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:51,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash 34512989, now seen corresponding path program 1 times [2018-11-10 13:00:51,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:00:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:51,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1805952475, now seen corresponding path program 1 times [2018-11-10 13:00:51,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:51,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:51,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:51,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:51,312 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:00:51,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:00:51,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:00:51,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:00:51,313 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:00:51,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:51,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:00:51,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:00:51,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration2_Loop [2018-11-10 13:00:51,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:00:51,314 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:00:51,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:51,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:51,414 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:00:51,415 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/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-10 13:00:51,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:00:51,420 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/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-10 13:00:51,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:00:51,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:00:51,766 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:00:51,768 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:00:51,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:00:51,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:00:51,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:00:51,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:00:51,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:51,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:00:51,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:00:51,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration2_Loop [2018-11-10 13:00:51,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:00:51,769 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:00:51,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:51,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:51,800 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:00:51,803 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:00:51,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:51,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:51,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:51,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:51,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:51,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:51,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:51,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:51,814 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:00:51,822 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:00:51,822 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:00:51,823 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:00:51,823 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:00:51,824 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:00:51,824 INFO L519 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-10 13:00:51,825 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:00:51,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:51,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:51,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:51,871 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-10 13:00:51,871 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 65 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 13:00:51,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 65 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 106 states and 123 transitions. Complement of second has 7 states. [2018-11-10 13:00:51,957 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-10 13:00:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:00:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-10 13:00:51,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 13:00:51,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:51,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 13:00:51,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:51,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 13:00:51,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:51,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 123 transitions. [2018-11-10 13:00:51,963 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2018-11-10 13:00:51,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 85 states and 100 transitions. [2018-11-10 13:00:51,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 13:00:51,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2018-11-10 13:00:51,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 100 transitions. [2018-11-10 13:00:51,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:00:51,965 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-10 13:00:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 100 transitions. [2018-11-10 13:00:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2018-11-10 13:00:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 13:00:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-11-10 13:00:51,968 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-10 13:00:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:51,969 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 3 states. [2018-11-10 13:00:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:51,991 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-10 13:00:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:51,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 82 transitions. [2018-11-10 13:00:51,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2018-11-10 13:00:51,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 68 states and 78 transitions. [2018-11-10 13:00:51,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-10 13:00:51,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-10 13:00:51,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 78 transitions. [2018-11-10 13:00:51,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:00:51,993 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-10 13:00:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 78 transitions. [2018-11-10 13:00:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-11-10 13:00:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 13:00:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2018-11-10 13:00:51,995 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-11-10 13:00:51,995 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-11-10 13:00:51,995 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:00:51,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 73 transitions. [2018-11-10 13:00:51,996 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2018-11-10 13:00:51,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:51,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:51,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 13:00:51,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:00:51,997 INFO L793 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 502#L19-4 assume true; 516#L19-1 assume !(main_~x~0 < main_~n~0); 521#L19-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~v~0;main_~v~0 := 0; 525#L26-4 [2018-11-10 13:00:51,997 INFO L795 eck$LassoCheckResult]: Loop: 525#L26-4 assume true; 526#L26-1 assume !!(main_~v~0 < 100000); 489#L27 SUMMARY for call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + main_~v~0 * 4, 4); srcloc: L27 480#L27-1 assume { :begin_inline_elem_exists } true;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; 481#L9-4 assume true; 484#L9-1 assume !(elem_exists_~i~0 < elem_exists_~size); 496#L9-5 elem_exists_#res := 0; 509#L12 main_#t~ret8 := elem_exists_#res;assume { :end_inline_elem_exists } true; 510#L27-2 assume !(main_#t~ret8 != 0);havoc main_#t~ret8;havoc main_#t~mem7; 511#L27-4 main_~x~0 := 0; 512#L30-4 assume true; 517#L30-1 assume !(main_~x~0 < main_~n~0); 522#L26-3 main_#t~post6 := main_~v~0;main_~v~0 := main_#t~post6 + 1;havoc main_#t~post6; 525#L26-4 [2018-11-10 13:00:51,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:51,997 INFO L82 PathProgramCache]: Analyzing trace with hash 28694820, now seen corresponding path program 1 times [2018-11-10 13:00:51,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:51,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:51,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:51,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:51,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:52,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1152002032, now seen corresponding path program 1 times [2018-11-10 13:00:52,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:52,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:52,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:52,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:52,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1380941741, now seen corresponding path program 1 times [2018-11-10 13:00:52,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:52,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:52,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:52,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:52,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:52,328 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 13:00:52,355 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:00:52,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:00:52,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:00:52,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:00:52,355 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:00:52,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:52,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:00:52,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:00:52,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration3_Lasso [2018-11-10 13:00:52,356 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:00:52,356 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:00:52,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:52,734 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:00:52,734 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:00:52,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:52,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:52,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:52,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:52,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:52,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:52,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:52,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:52,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:52,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:52,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:52,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:52,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:52,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:52,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:52,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:52,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:52,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:52,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:52,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:52,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:52,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:52,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:52,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:52,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:52,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:52,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:52,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:52,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:52,806 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:00:52,823 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:00:52,823 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 13:00:52,824 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:00:52,826 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:00:52,826 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:00:52,826 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_main_~v~0) = 199999*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 8*ULTIMATE.start_main_~v~0 Supporting invariants [] [2018-11-10 13:00:52,847 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 13:00:52,858 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:00:52,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 13:00:52,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 13:00:52,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:52,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:52,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:52,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 13:00:52,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 73 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-10 13:00:53,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 73 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 120 states and 141 transitions. Complement of second has 8 states. [2018-11-10 13:00:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 13:00:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 13:00:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-10 13:00:53,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 13 letters. [2018-11-10 13:00:53,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:53,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 18 letters. Loop has 13 letters. [2018-11-10 13:00:53,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:53,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 26 letters. [2018-11-10 13:00:53,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:53,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 141 transitions. [2018-11-10 13:00:53,015 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-10 13:00:53,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 103 states and 122 transitions. [2018-11-10 13:00:53,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 13:00:53,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-10 13:00:53,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2018-11-10 13:00:53,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:00:53,016 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-10 13:00:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2018-11-10 13:00:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-10 13:00:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 13:00:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-11-10 13:00:53,019 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-10 13:00:53,020 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-10 13:00:53,020 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:00:53,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 122 transitions. [2018-11-10 13:00:53,020 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-10 13:00:53,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:53,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:53,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:00:53,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 13:00:53,021 INFO L793 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 810#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 811#L19-4 assume true; 832#L19-1 assume !(main_~x~0 < main_~n~0); 840#L19-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~v~0;main_~v~0 := 0; 844#L26-4 assume true; 846#L26-1 assume !!(main_~v~0 < 100000); 787#L27 SUMMARY for call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + main_~v~0 * 4, 4); srcloc: L27 775#L27-1 assume { :begin_inline_elem_exists } true;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; 776#L9-4 [2018-11-10 13:00:53,021 INFO L795 eck$LassoCheckResult]: Loop: 776#L9-4 assume true; 779#L9-1 assume !!(elem_exists_~i~0 < elem_exists_~size); 801#L10 SUMMARY for call elem_exists_#t~mem1 := read~int(elem_exists_~set.base, elem_exists_~set.offset + elem_exists_~i~0 * 4, 4); srcloc: L10 816#L10-1 assume !(elem_exists_#t~mem1 == elem_exists_~value);havoc elem_exists_#t~mem1; 797#L9-3 elem_exists_#t~post0 := elem_exists_~i~0;elem_exists_~i~0 := elem_exists_#t~post0 + 1;havoc elem_exists_#t~post0; 776#L9-4 [2018-11-10 13:00:53,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash 322065962, now seen corresponding path program 1 times [2018-11-10 13:00:53,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:53,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:53,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash 83179611, now seen corresponding path program 1 times [2018-11-10 13:00:53,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:53,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:53,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash 666850258, now seen corresponding path program 1 times [2018-11-10 13:00:53,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:53,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:53,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:53,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:53,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:00:53,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:00:53,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:00:53,116 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. cyclomatic complexity: 25 Second operand 5 states. [2018-11-10 13:00:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:53,161 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-11-10 13:00:53,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:00:53,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 180 transitions. [2018-11-10 13:00:53,162 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 49 [2018-11-10 13:00:53,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 157 states and 178 transitions. [2018-11-10 13:00:53,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-10 13:00:53,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-11-10 13:00:53,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 178 transitions. [2018-11-10 13:00:53,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:00:53,164 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 178 transitions. [2018-11-10 13:00:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 178 transitions. [2018-11-10 13:00:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 97. [2018-11-10 13:00:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 13:00:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2018-11-10 13:00:53,168 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 112 transitions. [2018-11-10 13:00:53,168 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 112 transitions. [2018-11-10 13:00:53,168 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:00:53,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 112 transitions. [2018-11-10 13:00:53,169 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 13:00:53,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:53,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:53,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:00:53,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 13:00:53,170 INFO L793 eck$LassoCheckResult]: Stem: 1124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1092#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 1093#L19-4 assume true; 1114#L19-1 assume !(main_~x~0 < main_~n~0); 1121#L19-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~v~0;main_~v~0 := 0; 1125#L26-4 assume true; 1127#L26-1 assume !!(main_~v~0 < 100000); 1134#L27 SUMMARY for call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + main_~v~0 * 4, 4); srcloc: L27 1049#L27-1 assume { :begin_inline_elem_exists } true;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; 1050#L9-4 assume true; 1057#L9-1 assume !(elem_exists_~i~0 < elem_exists_~size); 1080#L9-5 elem_exists_#res := 0; 1101#L12 main_#t~ret8 := elem_exists_#res;assume { :end_inline_elem_exists } true; 1102#L27-2 assume main_#t~ret8 != 0;havoc main_#t~ret8;havoc main_#t~mem7; 1109#L28 SUMMARY for call main_#t~mem9 := read~int(main_~#values~0.base, main_~#values~0.offset + main_~v~0 * 4, 4); srcloc: L28 1117#L28-1 assume { :begin_inline_insert } true;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; 1118#L4 SUMMARY for call write~int(insert_~value, insert_~set.base, insert_~set.offset + insert_~size * 4, 4); srcloc: L4 1132#L4-1 insert_#res := insert_~size + 1; 1059#L5 main_#t~ret10 := insert_#res;assume { :end_inline_insert } true;main_~n~0 := main_#t~ret10;havoc main_#t~ret10;havoc main_#t~mem9; 1060#L27-4 main_~x~0 := 0; 1106#L30-4 [2018-11-10 13:00:53,170 INFO L795 eck$LassoCheckResult]: Loop: 1106#L30-4 assume true; 1115#L30-1 assume !!(main_~x~0 < main_~n~0);main_~y~0 := main_~x~0 + 1; 1071#L31-4 assume true; 1072#L31-1 assume !(main_~y~0 < main_~n~0); 1084#L30-3 main_#t~post11 := main_~x~0;main_~x~0 := main_#t~post11 + 1;havoc main_#t~post11; 1106#L30-4 [2018-11-10 13:00:53,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1160820614, now seen corresponding path program 1 times [2018-11-10 13:00:53,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:53,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:53,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:53,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:00:53,192 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 13:00:53,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash 117537524, now seen corresponding path program 1 times [2018-11-10 13:00:53,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:53,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:53,221 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:00:53,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:00:53,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:00:53,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:00:53,222 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:00:53,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:53,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:00:53,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:00:53,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration5_Loop [2018-11-10 13:00:53,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:00:53,222 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:00:53,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-10 13:00:53,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:53,253 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:00:53,254 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/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-10 13:00:53,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:00:53,264 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03d20b4c-8df0-4df6-8fc1-8f53cbfdff45/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-10 13:00:53,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:00:53,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:00:53,573 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:00:53,574 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:00:53,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:00:53,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:00:53,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:00:53,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:00:53,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:53,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:00:53,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:00:53,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration5_Loop [2018-11-10 13:00:53,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:00:53,575 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:00:53,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:53,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:00:53,595 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:00:53,595 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:00:53,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:53,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:53,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:53,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:53,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:53,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:53,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:53,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:53,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:53,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:53,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:53,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:53,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:53,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:53,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:53,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:53,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:53,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:00:53,602 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:00:53,602 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:00:53,603 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:00:53,603 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 13:00:53,603 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:00:53,603 INFO L519 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-10 13:00:53,603 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 13:00:53,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:53,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:53,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:53,646 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-10 13:00:53,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-10 13:00:53,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 284 states and 322 transitions. Complement of second has 7 states. [2018-11-10 13:00:53,676 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-10 13:00:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 13:00:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-10 13:00:53,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 13:00:53,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 13:00:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-10 13:00:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:53,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 322 transitions. [2018-11-10 13:00:53,679 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 40 [2018-11-10 13:00:53,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 217 states and 248 transitions. [2018-11-10 13:00:53,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-11-10 13:00:53,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2018-11-10 13:00:53,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 217 states and 248 transitions. [2018-11-10 13:00:53,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:00:53,681 INFO L705 BuchiCegarLoop]: Abstraction has 217 states and 248 transitions. [2018-11-10 13:00:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 248 transitions. [2018-11-10 13:00:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 158. [2018-11-10 13:00:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 13:00:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2018-11-10 13:00:53,689 INFO L728 BuchiCegarLoop]: Abstraction has 158 states and 179 transitions. [2018-11-10 13:00:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:00:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:00:53,689 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand 4 states. [2018-11-10 13:00:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:53,700 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-10 13:00:53,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:00:53,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 43 transitions. [2018-11-10 13:00:53,701 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:00:53,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2018-11-10 13:00:53,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:00:53,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:00:53,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:00:53,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:00:53,702 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:00:53,702 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:00:53,702 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:00:53,702 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 13:00:53,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:00:53,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:00:53,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:00:53,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:00:53 BoogieIcfgContainer [2018-11-10 13:00:53,707 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:00:53,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:00:53,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:00:53,707 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:00:53,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:50" (3/4) ... [2018-11-10 13:00:53,710 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:00:53,710 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:00:53,711 INFO L168 Benchmark]: Toolchain (without parser) took 3245.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:53,711 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:53,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:53,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.03 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:53,713 INFO L168 Benchmark]: Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:53,713 INFO L168 Benchmark]: RCFGBuilder took 280.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:53,714 INFO L168 Benchmark]: BuchiAutomizer took 2726.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 78.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:53,714 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:53,719 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.14 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 186.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.03 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 280.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2726.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 78.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + n and consists of 4 locations. One deterministic module has affine ranking function 199999 * unknown-#length-unknown[#Ultimate.alloc_#res] + -8 * v and consists of 5 locations. One deterministic module has affine ranking function n + -1 * x and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 143 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 103 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 317 SDtfs, 246 SDslu, 351 SDs, 0 SdLazy, 140 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT1 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital46 mio100 ax100 hnf95 lsp94 ukn100 mio100 lsp87 div100 bol100 ite100 ukn100 eq168 hnf92 smp85 dnf100 smp100 tf106 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...