./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 09:27:39,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 09:27:39,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 09:27:39,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 09:27:39,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 09:27:39,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 09:27:39,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 09:27:39,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 09:27:39,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 09:27:39,881 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 09:27:39,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 09:27:39,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 09:27:39,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 09:27:39,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 09:27:39,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 09:27:39,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 09:27:39,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 09:27:39,885 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 09:27:39,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 09:27:39,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 09:27:39,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 09:27:39,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 09:27:39,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 09:27:39,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 09:27:39,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 09:27:39,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 09:27:39,890 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 09:27:39,891 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 09:27:39,891 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 09:27:39,892 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 09:27:39,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 09:27:39,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 09:27:39,892 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 09:27:39,893 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 09:27:39,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 09:27:39,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 09:27:39,894 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 09:27:39,901 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 09:27:39,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 09:27:39,902 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 09:27:39,902 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 09:27:39,902 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 09:27:39,903 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 09:27:39,903 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 09:27:39,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 09:27:39,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 09:27:39,904 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 09:27:39,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 09:27:39,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 09:27:39,905 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 09:27:39,905 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 09:27:39,905 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_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-12-01 09:27:39,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 09:27:39,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 09:27:39,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 09:27:39,935 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 09:27:39,935 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 09:27:39,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 09:27:39,977 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/data/b77741e45/e52518e83c234294bde134bcee1cc16b/FLAG945e62f8f [2018-12-01 09:27:40,345 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 09:27:40,346 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 09:27:40,350 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/data/b77741e45/e52518e83c234294bde134bcee1cc16b/FLAG945e62f8f [2018-12-01 09:27:40,714 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/data/b77741e45/e52518e83c234294bde134bcee1cc16b [2018-12-01 09:27:40,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 09:27:40,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 09:27:40,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 09:27:40,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 09:27:40,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 09:27:40,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1840ea76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40, skipping insertion in model container [2018-12-01 09:27:40,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 09:27:40,742 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 09:27:40,833 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 09:27:40,836 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 09:27:40,852 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 09:27:40,860 INFO L195 MainTranslator]: Completed translation [2018-12-01 09:27:40,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40 WrapperNode [2018-12-01 09:27:40,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 09:27:40,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 09:27:40,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 09:27:40,861 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 09:27:40,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 09:27:40,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 09:27:40,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 09:27:40,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 09:27:40,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... [2018-12-01 09:27:40,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 09:27:40,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 09:27:40,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 09:27:40,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 09:27:40,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/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-12-01 09:27:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 09:27:40,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 09:27:41,119 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 09:27:41,119 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 09:27:41,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:27:41 BoogieIcfgContainer [2018-12-01 09:27:41,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 09:27:41,120 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 09:27:41,120 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 09:27:41,122 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 09:27:41,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 09:27:41,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 09:27:40" (1/3) ... [2018-12-01 09:27:41,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5271c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 09:27:41, skipping insertion in model container [2018-12-01 09:27:41,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 09:27:41,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:27:40" (2/3) ... [2018-12-01 09:27:41,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5271c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 09:27:41, skipping insertion in model container [2018-12-01 09:27:41,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 09:27:41,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:27:41" (3/3) ... [2018-12-01 09:27:41,125 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 09:27:41,160 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 09:27:41,160 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 09:27:41,160 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 09:27:41,161 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 09:27:41,161 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 09:27:41,161 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 09:27:41,161 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 09:27:41,161 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 09:27:41,161 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 09:27:41,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2018-12-01 09:27:41,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-01 09:27:41,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,189 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 09:27:41,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2018-12-01 09:27:41,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-01 09:27:41,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,197 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 9#L223-1true [2018-12-01 09:27:41,198 INFO L796 eck$LassoCheckResult]: Loop: 9#L223-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 41#L56true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4#L91true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L91-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L95-1true assume !(0 != main_~p3~0); 30#L99-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 21#L103-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 38#L107-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 43#L111-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 35#L115-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 51#L119-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 44#L123-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 48#L127-1true assume !(0 != main_~p11~0); 14#L131-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 6#L135-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 27#L139-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 32#L143-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 23#L147-1true assume !(0 != main_~p1~0); 15#L153-1true assume !(0 != main_~p2~0); 24#L158-1true assume !(0 != main_~p3~0); 53#L163-1true assume !(0 != main_~p4~0); 7#L168-1true assume !(0 != main_~p5~0); 40#L173-1true assume !(0 != main_~p6~0); 46#L178-1true assume !(0 != main_~p7~0); 29#L183-1true assume !(0 != main_~p8~0); 33#L188-1true assume !(0 != main_~p9~0); 11#L193-1true assume !(0 != main_~p10~0); 20#L198-1true assume !(0 != main_~p11~0); 50#L203-1true assume !(0 != main_~p12~0); 3#L208-1true assume !(0 != main_~p13~0); 26#L213-1true assume !(0 != main_~p14~0); 55#L218-1true assume !(0 != main_~p15~0); 9#L223-1true [2018-12-01 09:27:41,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-01 09:27:41,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1871293818, now seen corresponding path program 1 times [2018-12-01 09:27:41,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:41,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:41,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:41,318 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:41,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:41,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:41,329 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-12-01 09:27:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:41,352 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2018-12-01 09:27:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:41,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 189 transitions. [2018-12-01 09:27:41,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2018-12-01 09:27:41,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 94 states and 152 transitions. [2018-12-01 09:27:41,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-12-01 09:27:41,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2018-12-01 09:27:41,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 152 transitions. [2018-12-01 09:27:41,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:41,362 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 152 transitions. [2018-12-01 09:27:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 152 transitions. [2018-12-01 09:27:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-01 09:27:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-01 09:27:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 152 transitions. [2018-12-01 09:27:41,382 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 152 transitions. [2018-12-01 09:27:41,382 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 152 transitions. [2018-12-01 09:27:41,382 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 09:27:41,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 152 transitions. [2018-12-01 09:27:41,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2018-12-01 09:27:41,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,384 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 187#L223-1 [2018-12-01 09:27:41,385 INFO L796 eck$LassoCheckResult]: Loop: 187#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 188#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 220#L91 assume !(0 != main_~p1~0); 221#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 240#L95-1 assume !(0 != main_~p3~0); 239#L99-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 238#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 237#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 235#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 232#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 217#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 206#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 207#L127-1 assume !(0 != main_~p11~0); 197#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 176#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 177#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 215#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 218#L147-1 assume !(0 != main_~p1~0); 222#L153-1 assume !(0 != main_~p2~0); 258#L158-1 assume !(0 != main_~p3~0); 256#L163-1 assume !(0 != main_~p4~0); 254#L168-1 assume !(0 != main_~p5~0); 252#L173-1 assume !(0 != main_~p6~0); 250#L178-1 assume !(0 != main_~p7~0); 247#L183-1 assume !(0 != main_~p8~0); 246#L188-1 assume !(0 != main_~p9~0); 244#L193-1 assume !(0 != main_~p10~0); 241#L198-1 assume !(0 != main_~p11~0); 214#L203-1 assume !(0 != main_~p12~0); 166#L208-1 assume !(0 != main_~p13~0); 168#L213-1 assume !(0 != main_~p14~0); 173#L218-1 assume !(0 != main_~p15~0); 187#L223-1 [2018-12-01 09:27:41,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-01 09:27:41,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1848661564, now seen corresponding path program 1 times [2018-12-01 09:27:41,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:41,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:41,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:41,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:41,414 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:41,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:41,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:41,415 INFO L87 Difference]: Start difference. First operand 94 states and 152 transitions. cyclomatic complexity: 60 Second operand 3 states. [2018-12-01 09:27:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:41,428 INFO L93 Difference]: Finished difference Result 185 states and 297 transitions. [2018-12-01 09:27:41,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:41,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 297 transitions. [2018-12-01 09:27:41,431 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2018-12-01 09:27:41,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 185 states and 297 transitions. [2018-12-01 09:27:41,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2018-12-01 09:27:41,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2018-12-01 09:27:41,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 297 transitions. [2018-12-01 09:27:41,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:41,433 INFO L705 BuchiCegarLoop]: Abstraction has 185 states and 297 transitions. [2018-12-01 09:27:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 297 transitions. [2018-12-01 09:27:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-01 09:27:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-01 09:27:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 297 transitions. [2018-12-01 09:27:41,440 INFO L728 BuchiCegarLoop]: Abstraction has 185 states and 297 transitions. [2018-12-01 09:27:41,440 INFO L608 BuchiCegarLoop]: Abstraction has 185 states and 297 transitions. [2018-12-01 09:27:41,441 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 09:27:41,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 297 transitions. [2018-12-01 09:27:41,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2018-12-01 09:27:41,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,443 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 513#L223-1 [2018-12-01 09:27:41,443 INFO L796 eck$LassoCheckResult]: Loop: 513#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 550#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 551#L91 assume !(0 != main_~p1~0); 573#L91-2 assume !(0 != main_~p2~0); 474#L95-1 assume !(0 != main_~p3~0); 475#L99-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 541#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 542#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 537#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 538#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 514#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 495#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 496#L127-1 assume !(0 != main_~p11~0); 482#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 483#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 509#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 510#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 519#L147-1 assume !(0 != main_~p1~0); 520#L153-1 assume !(0 != main_~p2~0); 553#L158-1 assume !(0 != main_~p3~0); 614#L163-1 assume !(0 != main_~p4~0); 612#L168-1 assume !(0 != main_~p5~0); 606#L173-1 assume !(0 != main_~p6~0); 602#L178-1 assume !(0 != main_~p7~0); 597#L183-1 assume !(0 != main_~p8~0); 594#L188-1 assume !(0 != main_~p9~0); 590#L193-1 assume !(0 != main_~p10~0); 571#L198-1 assume !(0 != main_~p11~0); 570#L203-1 assume !(0 != main_~p12~0); 568#L208-1 assume !(0 != main_~p13~0); 567#L213-1 assume !(0 != main_~p14~0); 562#L218-1 assume !(0 != main_~p15~0); 513#L223-1 [2018-12-01 09:27:41,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-12-01 09:27:41,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash -462458170, now seen corresponding path program 1 times [2018-12-01 09:27:41,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:41,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:41,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:41,470 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:41,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:41,471 INFO L87 Difference]: Start difference. First operand 185 states and 297 transitions. cyclomatic complexity: 116 Second operand 3 states. [2018-12-01 09:27:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:41,488 INFO L93 Difference]: Finished difference Result 365 states and 581 transitions. [2018-12-01 09:27:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:41,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 581 transitions. [2018-12-01 09:27:41,490 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2018-12-01 09:27:41,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 365 states and 581 transitions. [2018-12-01 09:27:41,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2018-12-01 09:27:41,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2018-12-01 09:27:41,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 581 transitions. [2018-12-01 09:27:41,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:41,493 INFO L705 BuchiCegarLoop]: Abstraction has 365 states and 581 transitions. [2018-12-01 09:27:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 581 transitions. [2018-12-01 09:27:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-12-01 09:27:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-01 09:27:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 581 transitions. [2018-12-01 09:27:41,503 INFO L728 BuchiCegarLoop]: Abstraction has 365 states and 581 transitions. [2018-12-01 09:27:41,503 INFO L608 BuchiCegarLoop]: Abstraction has 365 states and 581 transitions. [2018-12-01 09:27:41,503 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 09:27:41,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 581 transitions. [2018-12-01 09:27:41,504 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2018-12-01 09:27:41,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,505 INFO L794 eck$LassoCheckResult]: Stem: 1060#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1061#L223-1 [2018-12-01 09:27:41,505 INFO L796 eck$LassoCheckResult]: Loop: 1061#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1135#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1130#L91 assume !(0 != main_~p1~0); 1122#L91-2 assume !(0 != main_~p2~0); 1118#L95-1 assume !(0 != main_~p3~0); 1111#L99-1 assume !(0 != main_~p4~0); 1112#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1252#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1251#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1250#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1249#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1248#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1247#L127-1 assume !(0 != main_~p11~0); 1246#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1243#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1242#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1074#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1075#L147-1 assume !(0 != main_~p1~0); 1203#L153-1 assume !(0 != main_~p2~0); 1204#L158-1 assume !(0 != main_~p3~0); 1261#L163-1 assume !(0 != main_~p4~0); 1258#L168-1 assume !(0 != main_~p5~0); 1256#L173-1 assume !(0 != main_~p6~0); 1216#L178-1 assume !(0 != main_~p7~0); 1205#L183-1 assume !(0 != main_~p8~0); 1174#L188-1 assume !(0 != main_~p9~0); 1172#L193-1 assume !(0 != main_~p10~0); 1165#L198-1 assume !(0 != main_~p11~0); 1160#L203-1 assume !(0 != main_~p12~0); 1152#L208-1 assume !(0 != main_~p13~0); 1150#L213-1 assume !(0 != main_~p14~0); 1148#L218-1 assume !(0 != main_~p15~0); 1061#L223-1 [2018-12-01 09:27:41,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-12-01 09:27:41,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1460769864, now seen corresponding path program 1 times [2018-12-01 09:27:41,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:41,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:41,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:41,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:41,530 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:41,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:41,530 INFO L87 Difference]: Start difference. First operand 365 states and 581 transitions. cyclomatic complexity: 224 Second operand 3 states. [2018-12-01 09:27:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:41,540 INFO L93 Difference]: Finished difference Result 721 states and 1137 transitions. [2018-12-01 09:27:41,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:41,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1137 transitions. [2018-12-01 09:27:41,546 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2018-12-01 09:27:41,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1137 transitions. [2018-12-01 09:27:41,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2018-12-01 09:27:41,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2018-12-01 09:27:41,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 721 states and 1137 transitions. [2018-12-01 09:27:41,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:41,551 INFO L705 BuchiCegarLoop]: Abstraction has 721 states and 1137 transitions. [2018-12-01 09:27:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1137 transitions. [2018-12-01 09:27:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-12-01 09:27:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-12-01 09:27:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1137 transitions. [2018-12-01 09:27:41,568 INFO L728 BuchiCegarLoop]: Abstraction has 721 states and 1137 transitions. [2018-12-01 09:27:41,568 INFO L608 BuchiCegarLoop]: Abstraction has 721 states and 1137 transitions. [2018-12-01 09:27:41,568 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 09:27:41,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 721 states and 1137 transitions. [2018-12-01 09:27:41,573 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2018-12-01 09:27:41,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,574 INFO L794 eck$LassoCheckResult]: Stem: 2150#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2151#L223-1 [2018-12-01 09:27:41,575 INFO L796 eck$LassoCheckResult]: Loop: 2151#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2200#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2419#L91 assume !(0 != main_~p1~0); 2415#L91-2 assume !(0 != main_~p2~0); 2413#L95-1 assume !(0 != main_~p3~0); 2412#L99-1 assume !(0 != main_~p4~0); 2409#L103-1 assume !(0 != main_~p5~0); 2407#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2405#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2403#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2401#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2399#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2397#L127-1 assume !(0 != main_~p11~0); 2395#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2393#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2391#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2389#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2387#L147-1 assume !(0 != main_~p1~0); 2352#L153-1 assume !(0 != main_~p2~0); 2349#L158-1 assume !(0 != main_~p3~0); 2341#L163-1 assume !(0 != main_~p4~0); 2333#L168-1 assume !(0 != main_~p5~0); 2331#L173-1 assume !(0 != main_~p6~0); 2286#L178-1 assume !(0 != main_~p7~0); 2280#L183-1 assume !(0 != main_~p8~0); 2270#L188-1 assume !(0 != main_~p9~0); 2269#L193-1 assume !(0 != main_~p10~0); 2260#L198-1 assume !(0 != main_~p11~0); 2261#L203-1 assume !(0 != main_~p12~0); 2426#L208-1 assume !(0 != main_~p13~0); 2215#L213-1 assume !(0 != main_~p14~0); 2214#L218-1 assume !(0 != main_~p15~0); 2151#L223-1 [2018-12-01 09:27:41,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-12-01 09:27:41,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1522809478, now seen corresponding path program 1 times [2018-12-01 09:27:41,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:41,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:41,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:41,605 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:41,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:41,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:41,606 INFO L87 Difference]: Start difference. First operand 721 states and 1137 transitions. cyclomatic complexity: 432 Second operand 3 states. [2018-12-01 09:27:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:41,622 INFO L93 Difference]: Finished difference Result 1425 states and 2225 transitions. [2018-12-01 09:27:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:41,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1425 states and 2225 transitions. [2018-12-01 09:27:41,631 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2018-12-01 09:27:41,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1425 states to 1425 states and 2225 transitions. [2018-12-01 09:27:41,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1425 [2018-12-01 09:27:41,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1425 [2018-12-01 09:27:41,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1425 states and 2225 transitions. [2018-12-01 09:27:41,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:41,641 INFO L705 BuchiCegarLoop]: Abstraction has 1425 states and 2225 transitions. [2018-12-01 09:27:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states and 2225 transitions. [2018-12-01 09:27:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2018-12-01 09:27:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2018-12-01 09:27:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2225 transitions. [2018-12-01 09:27:41,664 INFO L728 BuchiCegarLoop]: Abstraction has 1425 states and 2225 transitions. [2018-12-01 09:27:41,664 INFO L608 BuchiCegarLoop]: Abstraction has 1425 states and 2225 transitions. [2018-12-01 09:27:41,664 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 09:27:41,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1425 states and 2225 transitions. [2018-12-01 09:27:41,669 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2018-12-01 09:27:41,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,670 INFO L794 eck$LassoCheckResult]: Stem: 4308#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 4309#L223-1 [2018-12-01 09:27:41,670 INFO L796 eck$LassoCheckResult]: Loop: 4309#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4372#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4373#L91 assume !(0 != main_~p1~0); 4568#L91-2 assume !(0 != main_~p2~0); 4567#L95-1 assume !(0 != main_~p3~0); 4565#L99-1 assume !(0 != main_~p4~0); 4561#L103-1 assume !(0 != main_~p5~0); 4557#L107-1 assume !(0 != main_~p6~0); 4555#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4553#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4551#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4549#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4547#L127-1 assume !(0 != main_~p11~0); 4545#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4543#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4541#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4539#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4536#L147-1 assume !(0 != main_~p1~0); 4537#L153-1 assume !(0 != main_~p2~0); 4531#L158-1 assume !(0 != main_~p3~0); 4530#L163-1 assume !(0 != main_~p4~0); 4477#L168-1 assume !(0 != main_~p5~0); 4479#L173-1 assume !(0 != main_~p6~0); 4473#L178-1 assume !(0 != main_~p7~0); 4472#L183-1 assume !(0 != main_~p8~0); 4467#L188-1 assume !(0 != main_~p9~0); 4466#L193-1 assume !(0 != main_~p10~0); 4459#L198-1 assume !(0 != main_~p11~0); 4460#L203-1 assume !(0 != main_~p12~0); 4454#L208-1 assume !(0 != main_~p13~0); 4453#L213-1 assume !(0 != main_~p14~0); 4382#L218-1 assume !(0 != main_~p15~0); 4309#L223-1 [2018-12-01 09:27:41,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,671 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-12-01 09:27:41,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1663358088, now seen corresponding path program 1 times [2018-12-01 09:27:41,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:41,697 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:41,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:41,697 INFO L87 Difference]: Start difference. First operand 1425 states and 2225 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-12-01 09:27:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:41,717 INFO L93 Difference]: Finished difference Result 2817 states and 4353 transitions. [2018-12-01 09:27:41,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:41,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2817 states and 4353 transitions. [2018-12-01 09:27:41,729 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2018-12-01 09:27:41,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2817 states to 2817 states and 4353 transitions. [2018-12-01 09:27:41,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2817 [2018-12-01 09:27:41,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2817 [2018-12-01 09:27:41,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2817 states and 4353 transitions. [2018-12-01 09:27:41,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:41,743 INFO L705 BuchiCegarLoop]: Abstraction has 2817 states and 4353 transitions. [2018-12-01 09:27:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states and 4353 transitions. [2018-12-01 09:27:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2018-12-01 09:27:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2018-12-01 09:27:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4353 transitions. [2018-12-01 09:27:41,776 INFO L728 BuchiCegarLoop]: Abstraction has 2817 states and 4353 transitions. [2018-12-01 09:27:41,776 INFO L608 BuchiCegarLoop]: Abstraction has 2817 states and 4353 transitions. [2018-12-01 09:27:41,776 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 09:27:41,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2817 states and 4353 transitions. [2018-12-01 09:27:41,785 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2018-12-01 09:27:41,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,786 INFO L794 eck$LassoCheckResult]: Stem: 8559#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 8560#L223-1 [2018-12-01 09:27:41,786 INFO L796 eck$LassoCheckResult]: Loop: 8560#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 8643#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8641#L91 assume !(0 != main_~p1~0); 8637#L91-2 assume !(0 != main_~p2~0); 8635#L95-1 assume !(0 != main_~p3~0); 8631#L99-1 assume !(0 != main_~p4~0); 8627#L103-1 assume !(0 != main_~p5~0); 8623#L107-1 assume !(0 != main_~p6~0); 8619#L111-1 assume !(0 != main_~p7~0); 8617#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8615#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8613#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8611#L127-1 assume !(0 != main_~p11~0); 8609#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8607#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8605#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8603#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8600#L147-1 assume !(0 != main_~p1~0); 8601#L153-1 assume !(0 != main_~p2~0); 8695#L158-1 assume !(0 != main_~p3~0); 8690#L163-1 assume !(0 != main_~p4~0); 8686#L168-1 assume !(0 != main_~p5~0); 8682#L173-1 assume !(0 != main_~p6~0); 8678#L178-1 assume !(0 != main_~p7~0); 8674#L183-1 assume !(0 != main_~p8~0); 8671#L188-1 assume !(0 != main_~p9~0); 8667#L193-1 assume !(0 != main_~p10~0); 8662#L198-1 assume !(0 != main_~p11~0); 8659#L203-1 assume !(0 != main_~p12~0); 8655#L208-1 assume !(0 != main_~p13~0); 8651#L213-1 assume !(0 != main_~p14~0); 8647#L218-1 assume !(0 != main_~p15~0); 8560#L223-1 [2018-12-01 09:27:41,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-12-01 09:27:41,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:41,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1529344582, now seen corresponding path program 1 times [2018-12-01 09:27:41,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:41,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:41,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:41,821 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:41,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:41,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:41,822 INFO L87 Difference]: Start difference. First operand 2817 states and 4353 transitions. cyclomatic complexity: 1600 Second operand 3 states. [2018-12-01 09:27:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:41,848 INFO L93 Difference]: Finished difference Result 5569 states and 8513 transitions. [2018-12-01 09:27:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:41,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5569 states and 8513 transitions. [2018-12-01 09:27:41,877 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2018-12-01 09:27:41,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5569 states to 5569 states and 8513 transitions. [2018-12-01 09:27:41,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5569 [2018-12-01 09:27:41,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5569 [2018-12-01 09:27:41,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5569 states and 8513 transitions. [2018-12-01 09:27:41,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:41,913 INFO L705 BuchiCegarLoop]: Abstraction has 5569 states and 8513 transitions. [2018-12-01 09:27:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states and 8513 transitions. [2018-12-01 09:27:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5569. [2018-12-01 09:27:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2018-12-01 09:27:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8513 transitions. [2018-12-01 09:27:41,981 INFO L728 BuchiCegarLoop]: Abstraction has 5569 states and 8513 transitions. [2018-12-01 09:27:41,981 INFO L608 BuchiCegarLoop]: Abstraction has 5569 states and 8513 transitions. [2018-12-01 09:27:41,981 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 09:27:41,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5569 states and 8513 transitions. [2018-12-01 09:27:41,996 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2018-12-01 09:27:41,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:41,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:41,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:41,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:41,997 INFO L794 eck$LassoCheckResult]: Stem: 16945#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 16946#L223-1 [2018-12-01 09:27:41,997 INFO L796 eck$LassoCheckResult]: Loop: 16946#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 17062#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17058#L91 assume !(0 != main_~p1~0); 17051#L91-2 assume !(0 != main_~p2~0); 17046#L95-1 assume !(0 != main_~p3~0); 17039#L99-1 assume !(0 != main_~p4~0); 17031#L103-1 assume !(0 != main_~p5~0); 17023#L107-1 assume !(0 != main_~p6~0); 17015#L111-1 assume !(0 != main_~p7~0); 17009#L115-1 assume !(0 != main_~p8~0); 17004#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 17005#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 16998#L127-1 assume !(0 != main_~p11~0); 16999#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 16992#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 16993#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 16984#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 16985#L147-1 assume !(0 != main_~p1~0); 17141#L153-1 assume !(0 != main_~p2~0); 17133#L158-1 assume !(0 != main_~p3~0); 17112#L163-1 assume !(0 != main_~p4~0); 17108#L168-1 assume !(0 != main_~p5~0); 17106#L173-1 assume !(0 != main_~p6~0); 17104#L178-1 assume !(0 != main_~p7~0); 17102#L183-1 assume !(0 != main_~p8~0); 17101#L188-1 assume !(0 != main_~p9~0); 17099#L193-1 assume !(0 != main_~p10~0); 17096#L198-1 assume !(0 != main_~p11~0); 17095#L203-1 assume !(0 != main_~p12~0); 17093#L208-1 assume !(0 != main_~p13~0); 17089#L213-1 assume !(0 != main_~p14~0); 17071#L218-1 assume !(0 != main_~p15~0); 16946#L223-1 [2018-12-01 09:27:41,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2018-12-01 09:27:41,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:41,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:41,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:42,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash -276093752, now seen corresponding path program 1 times [2018-12-01 09:27:42,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:42,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:42,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:42,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:42,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:42,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:42,026 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:42,026 INFO L87 Difference]: Start difference. First operand 5569 states and 8513 transitions. cyclomatic complexity: 3072 Second operand 3 states. [2018-12-01 09:27:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:42,049 INFO L93 Difference]: Finished difference Result 11009 states and 16641 transitions. [2018-12-01 09:27:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:42,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11009 states and 16641 transitions. [2018-12-01 09:27:42,077 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2018-12-01 09:27:42,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11009 states to 11009 states and 16641 transitions. [2018-12-01 09:27:42,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11009 [2018-12-01 09:27:42,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11009 [2018-12-01 09:27:42,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11009 states and 16641 transitions. [2018-12-01 09:27:42,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:42,114 INFO L705 BuchiCegarLoop]: Abstraction has 11009 states and 16641 transitions. [2018-12-01 09:27:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states and 16641 transitions. [2018-12-01 09:27:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11009. [2018-12-01 09:27:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11009 states. [2018-12-01 09:27:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11009 states to 11009 states and 16641 transitions. [2018-12-01 09:27:42,255 INFO L728 BuchiCegarLoop]: Abstraction has 11009 states and 16641 transitions. [2018-12-01 09:27:42,255 INFO L608 BuchiCegarLoop]: Abstraction has 11009 states and 16641 transitions. [2018-12-01 09:27:42,255 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 09:27:42,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11009 states and 16641 transitions. [2018-12-01 09:27:42,276 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2018-12-01 09:27:42,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:42,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:42,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:42,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:42,277 INFO L794 eck$LassoCheckResult]: Stem: 33534#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 33535#L223-1 [2018-12-01 09:27:42,277 INFO L796 eck$LassoCheckResult]: Loop: 33535#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 33895#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 33893#L91 assume !(0 != main_~p1~0); 33890#L91-2 assume !(0 != main_~p2~0); 33888#L95-1 assume !(0 != main_~p3~0); 33884#L99-1 assume !(0 != main_~p4~0); 33880#L103-1 assume !(0 != main_~p5~0); 33877#L107-1 assume !(0 != main_~p6~0); 33878#L111-1 assume !(0 != main_~p7~0); 33857#L115-1 assume !(0 != main_~p8~0); 33859#L119-1 assume !(0 != main_~p9~0); 33841#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 33842#L127-1 assume !(0 != main_~p11~0); 33827#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33828#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33811#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33812#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33798#L147-1 assume !(0 != main_~p1~0); 33799#L153-1 assume !(0 != main_~p2~0); 33710#L158-1 assume !(0 != main_~p3~0); 33709#L163-1 assume !(0 != main_~p4~0); 33696#L168-1 assume !(0 != main_~p5~0); 33698#L173-1 assume !(0 != main_~p6~0); 33918#L178-1 assume !(0 != main_~p7~0); 33916#L183-1 assume !(0 != main_~p8~0); 33914#L188-1 assume !(0 != main_~p9~0); 33912#L193-1 assume !(0 != main_~p10~0); 33908#L198-1 assume !(0 != main_~p11~0); 33906#L203-1 assume !(0 != main_~p12~0); 33903#L208-1 assume !(0 != main_~p13~0); 33900#L213-1 assume !(0 != main_~p14~0); 33897#L218-1 assume !(0 != main_~p15~0); 33535#L223-1 [2018-12-01 09:27:42,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2018-12-01 09:27:42,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:42,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:42,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash -57239034, now seen corresponding path program 1 times [2018-12-01 09:27:42,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:42,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:42,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:42,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:42,290 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:42,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:42,291 INFO L87 Difference]: Start difference. First operand 11009 states and 16641 transitions. cyclomatic complexity: 5888 Second operand 3 states. [2018-12-01 09:27:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:42,336 INFO L93 Difference]: Finished difference Result 21761 states and 32513 transitions. [2018-12-01 09:27:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:42,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21761 states and 32513 transitions. [2018-12-01 09:27:42,410 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2018-12-01 09:27:42,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21761 states to 21761 states and 32513 transitions. [2018-12-01 09:27:42,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21761 [2018-12-01 09:27:42,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21761 [2018-12-01 09:27:42,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21761 states and 32513 transitions. [2018-12-01 09:27:42,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:42,474 INFO L705 BuchiCegarLoop]: Abstraction has 21761 states and 32513 transitions. [2018-12-01 09:27:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21761 states and 32513 transitions. [2018-12-01 09:27:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21761 to 21761. [2018-12-01 09:27:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21761 states. [2018-12-01 09:27:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21761 states to 21761 states and 32513 transitions. [2018-12-01 09:27:42,635 INFO L728 BuchiCegarLoop]: Abstraction has 21761 states and 32513 transitions. [2018-12-01 09:27:42,635 INFO L608 BuchiCegarLoop]: Abstraction has 21761 states and 32513 transitions. [2018-12-01 09:27:42,635 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 09:27:42,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21761 states and 32513 transitions. [2018-12-01 09:27:42,671 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2018-12-01 09:27:42,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:42,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:42,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:42,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:42,672 INFO L794 eck$LassoCheckResult]: Stem: 66307#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 66308#L223-1 [2018-12-01 09:27:42,672 INFO L796 eck$LassoCheckResult]: Loop: 66308#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 67709#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 67710#L91 assume !(0 != main_~p1~0); 67665#L91-2 assume !(0 != main_~p2~0); 67667#L95-1 assume !(0 != main_~p3~0); 67645#L99-1 assume !(0 != main_~p4~0); 67647#L103-1 assume !(0 != main_~p5~0); 67621#L107-1 assume !(0 != main_~p6~0); 67623#L111-1 assume !(0 != main_~p7~0); 67870#L115-1 assume !(0 != main_~p8~0); 67867#L119-1 assume !(0 != main_~p9~0); 67864#L123-1 assume !(0 != main_~p10~0); 67862#L127-1 assume !(0 != main_~p11~0); 67858#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 67854#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 67850#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 67845#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 67838#L147-1 assume !(0 != main_~p1~0); 67830#L153-1 assume !(0 != main_~p2~0); 67821#L158-1 assume !(0 != main_~p3~0); 67812#L163-1 assume !(0 != main_~p4~0); 67806#L168-1 assume !(0 != main_~p5~0); 67776#L173-1 assume !(0 != main_~p6~0); 67778#L178-1 assume !(0 != main_~p7~0); 67745#L183-1 assume !(0 != main_~p8~0); 67746#L188-1 assume !(0 != main_~p9~0); 67796#L193-1 assume !(0 != main_~p10~0); 67781#L198-1 assume !(0 != main_~p11~0); 67782#L203-1 assume !(0 != main_~p12~0); 67741#L208-1 assume !(0 != main_~p13~0); 67740#L213-1 assume !(0 != main_~p14~0); 67724#L218-1 assume !(0 != main_~p15~0); 66308#L223-1 [2018-12-01 09:27:42,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2018-12-01 09:27:42,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:42,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:42,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash 365462792, now seen corresponding path program 1 times [2018-12-01 09:27:42,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:42,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:42,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:42,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:42,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:42,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:42,690 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:42,691 INFO L87 Difference]: Start difference. First operand 21761 states and 32513 transitions. cyclomatic complexity: 11264 Second operand 3 states. [2018-12-01 09:27:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:42,773 INFO L93 Difference]: Finished difference Result 43009 states and 63489 transitions. [2018-12-01 09:27:42,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:42,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43009 states and 63489 transitions. [2018-12-01 09:27:42,894 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2018-12-01 09:27:42,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43009 states to 43009 states and 63489 transitions. [2018-12-01 09:27:42,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43009 [2018-12-01 09:27:43,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43009 [2018-12-01 09:27:43,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43009 states and 63489 transitions. [2018-12-01 09:27:43,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:43,020 INFO L705 BuchiCegarLoop]: Abstraction has 43009 states and 63489 transitions. [2018-12-01 09:27:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43009 states and 63489 transitions. [2018-12-01 09:27:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43009 to 43009. [2018-12-01 09:27:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2018-12-01 09:27:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 63489 transitions. [2018-12-01 09:27:43,362 INFO L728 BuchiCegarLoop]: Abstraction has 43009 states and 63489 transitions. [2018-12-01 09:27:43,362 INFO L608 BuchiCegarLoop]: Abstraction has 43009 states and 63489 transitions. [2018-12-01 09:27:43,363 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-01 09:27:43,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43009 states and 63489 transitions. [2018-12-01 09:27:43,439 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2018-12-01 09:27:43,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:43,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:43,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:43,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:43,439 INFO L794 eck$LassoCheckResult]: Stem: 131089#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 131090#L223-1 [2018-12-01 09:27:43,440 INFO L796 eck$LassoCheckResult]: Loop: 131090#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 131728#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131722#L91 assume !(0 != main_~p1~0); 131714#L91-2 assume !(0 != main_~p2~0); 131708#L95-1 assume !(0 != main_~p3~0); 131702#L99-1 assume !(0 != main_~p4~0); 131694#L103-1 assume !(0 != main_~p5~0); 131687#L107-1 assume !(0 != main_~p6~0); 131681#L111-1 assume !(0 != main_~p7~0); 131683#L115-1 assume !(0 != main_~p8~0); 131856#L119-1 assume !(0 != main_~p9~0); 131849#L123-1 assume !(0 != main_~p10~0); 131843#L127-1 assume !(0 != main_~p11~0); 131835#L131-1 assume !(0 != main_~p12~0); 131828#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 131821#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131816#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131812#L147-1 assume !(0 != main_~p1~0); 131804#L153-1 assume !(0 != main_~p2~0); 131800#L158-1 assume !(0 != main_~p3~0); 131794#L163-1 assume !(0 != main_~p4~0); 131783#L168-1 assume !(0 != main_~p5~0); 131775#L173-1 assume !(0 != main_~p6~0); 131765#L178-1 assume !(0 != main_~p7~0); 131759#L183-1 assume !(0 != main_~p8~0); 131753#L188-1 assume !(0 != main_~p9~0); 131751#L193-1 assume !(0 != main_~p10~0); 131749#L198-1 assume !(0 != main_~p11~0); 131747#L203-1 assume !(0 != main_~p12~0); 131744#L208-1 assume !(0 != main_~p13~0); 131742#L213-1 assume !(0 != main_~p14~0); 131738#L218-1 assume !(0 != main_~p15~0); 131090#L223-1 [2018-12-01 09:27:43,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2018-12-01 09:27:43,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:43,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:43,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:43,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:43,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1323480950, now seen corresponding path program 1 times [2018-12-01 09:27:43,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:43,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:43,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:43,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:43,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:43,454 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:43,455 INFO L87 Difference]: Start difference. First operand 43009 states and 63489 transitions. cyclomatic complexity: 21504 Second operand 3 states. [2018-12-01 09:27:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:43,574 INFO L93 Difference]: Finished difference Result 84993 states and 123905 transitions. [2018-12-01 09:27:43,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:43,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84993 states and 123905 transitions. [2018-12-01 09:27:43,757 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2018-12-01 09:27:44,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84993 states to 84993 states and 123905 transitions. [2018-12-01 09:27:44,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84993 [2018-12-01 09:27:44,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84993 [2018-12-01 09:27:44,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84993 states and 123905 transitions. [2018-12-01 09:27:44,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:44,048 INFO L705 BuchiCegarLoop]: Abstraction has 84993 states and 123905 transitions. [2018-12-01 09:27:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84993 states and 123905 transitions. [2018-12-01 09:27:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84993 to 84993. [2018-12-01 09:27:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84993 states. [2018-12-01 09:27:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84993 states to 84993 states and 123905 transitions. [2018-12-01 09:27:44,675 INFO L728 BuchiCegarLoop]: Abstraction has 84993 states and 123905 transitions. [2018-12-01 09:27:44,675 INFO L608 BuchiCegarLoop]: Abstraction has 84993 states and 123905 transitions. [2018-12-01 09:27:44,675 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-01 09:27:44,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84993 states and 123905 transitions. [2018-12-01 09:27:44,807 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2018-12-01 09:27:44,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:44,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:44,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:44,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:44,809 INFO L794 eck$LassoCheckResult]: Stem: 259099#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 259100#L223-1 [2018-12-01 09:27:44,809 INFO L796 eck$LassoCheckResult]: Loop: 259100#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 260022#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 260019#L91 assume !(0 != main_~p1~0); 260015#L91-2 assume !(0 != main_~p2~0); 260012#L95-1 assume !(0 != main_~p3~0); 260009#L99-1 assume !(0 != main_~p4~0); 260005#L103-1 assume !(0 != main_~p5~0); 260001#L107-1 assume !(0 != main_~p6~0); 259997#L111-1 assume !(0 != main_~p7~0); 259993#L115-1 assume !(0 != main_~p8~0); 259989#L119-1 assume !(0 != main_~p9~0); 259986#L123-1 assume !(0 != main_~p10~0); 259938#L127-1 assume !(0 != main_~p11~0); 259939#L131-1 assume !(0 != main_~p12~0); 260100#L135-1 assume !(0 != main_~p13~0); 260099#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 260096#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 260093#L147-1 assume !(0 != main_~p1~0); 260082#L153-1 assume !(0 != main_~p2~0); 260078#L158-1 assume !(0 != main_~p3~0); 260072#L163-1 assume !(0 != main_~p4~0); 260067#L168-1 assume !(0 != main_~p5~0); 260061#L173-1 assume !(0 != main_~p6~0); 260055#L178-1 assume !(0 != main_~p7~0); 260049#L183-1 assume !(0 != main_~p8~0); 260045#L188-1 assume !(0 != main_~p9~0); 260044#L193-1 assume !(0 != main_~p10~0); 260040#L198-1 assume !(0 != main_~p11~0); 260036#L203-1 assume !(0 != main_~p12~0); 260034#L208-1 assume !(0 != main_~p13~0); 260031#L213-1 assume !(0 != main_~p14~0); 260027#L218-1 assume !(0 != main_~p15~0); 259100#L223-1 [2018-12-01 09:27:44,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2018-12-01 09:27:44,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:44,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:44,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:44,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash 977341640, now seen corresponding path program 1 times [2018-12-01 09:27:44,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:44,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:44,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:44,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 09:27:44,834 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:44,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:44,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:44,834 INFO L87 Difference]: Start difference. First operand 84993 states and 123905 transitions. cyclomatic complexity: 40960 Second operand 3 states. [2018-12-01 09:27:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:45,080 INFO L93 Difference]: Finished difference Result 167937 states and 241665 transitions. [2018-12-01 09:27:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:45,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167937 states and 241665 transitions. [2018-12-01 09:27:45,514 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2018-12-01 09:27:45,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167937 states to 167937 states and 241665 transitions. [2018-12-01 09:27:45,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167937 [2018-12-01 09:27:45,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167937 [2018-12-01 09:27:45,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167937 states and 241665 transitions. [2018-12-01 09:27:45,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:45,979 INFO L705 BuchiCegarLoop]: Abstraction has 167937 states and 241665 transitions. [2018-12-01 09:27:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167937 states and 241665 transitions. [2018-12-01 09:27:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167937 to 167937. [2018-12-01 09:27:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167937 states. [2018-12-01 09:27:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167937 states to 167937 states and 241665 transitions. [2018-12-01 09:27:47,331 INFO L728 BuchiCegarLoop]: Abstraction has 167937 states and 241665 transitions. [2018-12-01 09:27:47,331 INFO L608 BuchiCegarLoop]: Abstraction has 167937 states and 241665 transitions. [2018-12-01 09:27:47,331 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-01 09:27:47,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167937 states and 241665 transitions. [2018-12-01 09:27:47,828 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2018-12-01 09:27:47,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:47,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:47,830 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:47,830 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:47,830 INFO L794 eck$LassoCheckResult]: Stem: 512034#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 512035#L223-1 [2018-12-01 09:27:47,830 INFO L796 eck$LassoCheckResult]: Loop: 512035#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 512210#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 512206#L91 assume !(0 != main_~p1~0); 512199#L91-2 assume !(0 != main_~p2~0); 512194#L95-1 assume !(0 != main_~p3~0); 512187#L99-1 assume !(0 != main_~p4~0); 512179#L103-1 assume !(0 != main_~p5~0); 512171#L107-1 assume !(0 != main_~p6~0); 512163#L111-1 assume !(0 != main_~p7~0); 512155#L115-1 assume !(0 != main_~p8~0); 512147#L119-1 assume !(0 != main_~p9~0); 512139#L123-1 assume !(0 != main_~p10~0); 512134#L127-1 assume !(0 != main_~p11~0); 512127#L131-1 assume !(0 != main_~p12~0); 512119#L135-1 assume !(0 != main_~p13~0); 512113#L139-1 assume !(0 != main_~p14~0); 512107#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 512108#L147-1 assume !(0 != main_~p1~0); 512287#L153-1 assume !(0 != main_~p2~0); 512318#L158-1 assume !(0 != main_~p3~0); 512313#L163-1 assume !(0 != main_~p4~0); 512309#L168-1 assume !(0 != main_~p5~0); 512305#L173-1 assume !(0 != main_~p6~0); 512301#L178-1 assume !(0 != main_~p7~0); 512297#L183-1 assume !(0 != main_~p8~0); 512293#L188-1 assume !(0 != main_~p9~0); 512289#L193-1 assume !(0 != main_~p10~0); 512244#L198-1 assume !(0 != main_~p11~0); 512236#L203-1 assume !(0 != main_~p12~0); 512229#L208-1 assume !(0 != main_~p13~0); 512228#L213-1 assume !(0 != main_~p14~0); 512219#L218-1 assume !(0 != main_~p15~0); 512035#L223-1 [2018-12-01 09:27:47,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 13 times [2018-12-01 09:27:47,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:47,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:47,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:47,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash -611006262, now seen corresponding path program 1 times [2018-12-01 09:27:47,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:47,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:47,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 09:27:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 09:27:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 09:27:47,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 09:27:47,851 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 09:27:47,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 09:27:47,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 09:27:47,851 INFO L87 Difference]: Start difference. First operand 167937 states and 241665 transitions. cyclomatic complexity: 77824 Second operand 3 states. [2018-12-01 09:27:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 09:27:48,343 INFO L93 Difference]: Finished difference Result 331777 states and 471041 transitions. [2018-12-01 09:27:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 09:27:48,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331777 states and 471041 transitions. [2018-12-01 09:27:49,199 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2018-12-01 09:27:49,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331777 states to 331777 states and 471041 transitions. [2018-12-01 09:27:49,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331777 [2018-12-01 09:27:49,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331777 [2018-12-01 09:27:49,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331777 states and 471041 transitions. [2018-12-01 09:27:50,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 09:27:50,033 INFO L705 BuchiCegarLoop]: Abstraction has 331777 states and 471041 transitions. [2018-12-01 09:27:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331777 states and 471041 transitions. [2018-12-01 09:27:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331777 to 331777. [2018-12-01 09:27:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331777 states. [2018-12-01 09:27:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331777 states to 331777 states and 471041 transitions. [2018-12-01 09:27:54,900 INFO L728 BuchiCegarLoop]: Abstraction has 331777 states and 471041 transitions. [2018-12-01 09:27:54,900 INFO L608 BuchiCegarLoop]: Abstraction has 331777 states and 471041 transitions. [2018-12-01 09:27:54,900 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-01 09:27:54,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331777 states and 471041 transitions. [2018-12-01 09:27:55,513 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2018-12-01 09:27:55,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 09:27:55,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 09:27:55,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 09:27:55,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 09:27:55,515 INFO L794 eck$LassoCheckResult]: Stem: 1011747#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1011748#L223-1 [2018-12-01 09:27:55,515 INFO L796 eck$LassoCheckResult]: Loop: 1011748#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1011946#L56 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1011943#L91 assume !(0 != main_~p1~0); 1011940#L91-2 assume !(0 != main_~p2~0); 1011937#L95-1 assume !(0 != main_~p3~0); 1011933#L99-1 assume !(0 != main_~p4~0); 1011930#L103-1 assume !(0 != main_~p5~0); 1011926#L107-1 assume !(0 != main_~p6~0); 1011922#L111-1 assume !(0 != main_~p7~0); 1011918#L115-1 assume !(0 != main_~p8~0); 1011914#L119-1 assume !(0 != main_~p9~0); 1011910#L123-1 assume !(0 != main_~p10~0); 1011907#L127-1 assume !(0 != main_~p11~0); 1011903#L131-1 assume !(0 != main_~p12~0); 1011900#L135-1 assume !(0 != main_~p13~0); 1011832#L139-1 assume !(0 != main_~p14~0); 1011822#L143-1 assume !(0 != main_~p15~0); 1011823#L147-1 assume !(0 != main_~p1~0); 1012019#L153-1 assume !(0 != main_~p2~0); 1012015#L158-1 assume !(0 != main_~p3~0); 1012009#L163-1 assume !(0 != main_~p4~0); 1012003#L168-1 assume !(0 != main_~p5~0); 1011997#L173-1 assume !(0 != main_~p6~0); 1011991#L178-1 assume !(0 != main_~p7~0); 1011985#L183-1 assume !(0 != main_~p8~0); 1011979#L188-1 assume !(0 != main_~p9~0); 1011973#L193-1 assume !(0 != main_~p10~0); 1011967#L198-1 assume !(0 != main_~p11~0); 1011962#L203-1 assume !(0 != main_~p12~0); 1011956#L208-1 assume !(0 != main_~p13~0); 1011951#L213-1 assume !(0 != main_~p14~0); 1011949#L218-1 assume !(0 != main_~p15~0); 1011748#L223-1 [2018-12-01 09:27:55,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:55,516 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 14 times [2018-12-01 09:27:55,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:55,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:55,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:55,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1632074616, now seen corresponding path program 1 times [2018-12-01 09:27:55,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:55,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:55,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:55,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 09:27:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 09:27:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -606582617, now seen corresponding path program 1 times [2018-12-01 09:27:55,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 09:27:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 09:27:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 09:27:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 09:27:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 09:27:55,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 09:27:55 BoogieIcfgContainer [2018-12-01 09:27:55,712 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 09:27:55,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 09:27:55,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 09:27:55,713 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 09:27:55,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:27:41" (3/4) ... [2018-12-01 09:27:55,715 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-01 09:27:55,755 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c3f2cc9-b675-43d9-9a24-ae7d936290e3/bin-2019/uautomizer/witness.graphml [2018-12-01 09:27:55,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 09:27:55,755 INFO L168 Benchmark]: Toolchain (without parser) took 15038.82 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 961.4 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-01 09:27:55,756 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 09:27:55,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.53 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 09:27:55,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.56 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 09:27:55,757 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-01 09:27:55,758 INFO L168 Benchmark]: RCFGBuilder took 193.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-01 09:27:55,758 INFO L168 Benchmark]: BuchiAutomizer took 14592.83 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-01 09:27:55,758 INFO L168 Benchmark]: Witness Printer took 42.17 ms. Allocated memory is still 4.7 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-01 09:27:55,760 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.53 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 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 21.56 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14592.83 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 42.17 ms. Allocated memory is still 4.7 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331777 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 7.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.0s Buchi closure took 0.2s. Biggest automaton had 331777 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1517 SDtfs, 799 SDslu, 954 SDs, 0 SdLazy, 65 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI13 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 54]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64122418=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21a6043e=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67163934=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@153a75b1=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@355e05e9=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fbd0ce0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@284dc771=0, p15=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2afad1eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22c35a0c=0, lk15=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13b66e59=0, p14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@719d8279=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34e7cc78=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b6ca77e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6de5e6be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a883dee=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2601dadd=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; Loop: [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 [L91] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L99] COND FALSE !(p3 != 0) [L103] COND FALSE !(p4 != 0) [L107] COND FALSE !(p5 != 0) [L111] COND FALSE !(p6 != 0) [L115] COND FALSE !(p7 != 0) [L119] COND FALSE !(p8 != 0) [L123] COND FALSE !(p9 != 0) [L127] COND FALSE !(p10 != 0) [L131] COND FALSE !(p11 != 0) [L135] COND FALSE !(p12 != 0) [L139] COND FALSE !(p13 != 0) [L143] COND FALSE !(p14 != 0) [L147] COND FALSE !(p15 != 0) [L153] COND FALSE !(p1 != 0) [L158] COND FALSE !(p2 != 0) [L163] COND FALSE !(p3 != 0) [L168] COND FALSE !(p4 != 0) [L173] COND FALSE !(p5 != 0) [L178] COND FALSE !(p6 != 0) [L183] COND FALSE !(p7 != 0) [L188] COND FALSE !(p8 != 0) [L193] COND FALSE !(p9 != 0) [L198] COND FALSE !(p10 != 0) [L203] COND FALSE !(p11 != 0) [L208] COND FALSE !(p12 != 0) [L213] COND FALSE !(p13 != 0) [L218] COND FALSE !(p14 != 0) [L223] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...