./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/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 5107685577f81a5867811396b2c0a05eb5630c95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 13:02:53,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:02:53,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:02:53,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:02:53,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:02:53,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:02:53,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:02:53,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:02:53,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:02:53,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:02:53,300 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:02:53,300 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:02:53,301 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:02:53,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:02:53,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:02:53,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:02:53,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:02:53,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:02:53,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:02:53,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:02:53,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:02:53,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:02:53,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:02:53,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:02:53,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:02:53,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:02:53,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:02:53,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:02:53,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:02:53,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:02:53,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:02:53,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:02:53,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:02:53,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:02:53,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:02:53,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:02:53,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 13:02:53,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:02:53,322 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:02:53,323 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:02:53,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:02:53,323 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:02:53,323 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:02:53,323 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:02:53,323 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:02:53,323 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:02:53,324 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:02:53,324 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:02:53,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:02:53,325 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:02:53,325 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:02:53,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:02:53,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:02:53,326 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:02:53,326 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:02:53,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:02:53,326 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:02:53,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:02:53,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:02:53,326 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:02:53,327 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:02:53,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:02:53,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:02:53,327 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:02:53,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:02:53,327 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:02:53,328 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:02:53,330 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:02:53,330 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_f0448c50-28d7-4661-8e50-f1c57aa86a98/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-10 13:02:53,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:02:53,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:02:53,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:02:53,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:02:53,367 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:02:53,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 13:02:53,410 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/data/d6b8d4185/242f42fd317b4e10a108636e5002cac8/FLAG19333dad3 [2018-11-10 13:02:53,711 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:02:53,711 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 13:02:53,715 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/data/d6b8d4185/242f42fd317b4e10a108636e5002cac8/FLAG19333dad3 [2018-11-10 13:02:53,726 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/data/d6b8d4185/242f42fd317b4e10a108636e5002cac8 [2018-11-10 13:02:53,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:02:53,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:02:53,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:02:53,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:02:53,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:02:53,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53, skipping insertion in model container [2018-11-10 13:02:53,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:02:53,763 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:02:53,875 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:02:53,877 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:02:53,894 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:02:53,902 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:02:53,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53 WrapperNode [2018-11-10 13:02:53,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:02:53,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:02:53,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:02:53,903 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:02:53,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:02:53,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:02:53,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:02:53,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:02:53,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... [2018-11-10 13:02:53,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:02:53,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:02:53,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:02:53,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:02:53,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:02:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:02:54,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:02:54,175 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:02:54,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:54 BoogieIcfgContainer [2018-11-10 13:02:54,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:02:54,176 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:02:54,176 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:02:54,178 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:02:54,179 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:54,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:02:53" (1/3) ... [2018-11-10 13:02:54,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b993910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:02:54, skipping insertion in model container [2018-11-10 13:02:54,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:54,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:02:53" (2/3) ... [2018-11-10 13:02:54,180 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b993910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:02:54, skipping insertion in model container [2018-11-10 13:02:54,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:02:54,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:54" (3/3) ... [2018-11-10 13:02:54,181 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 13:02:54,223 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:02:54,224 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:02:54,224 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:02:54,224 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:02:54,224 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:02:54,225 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:02:54,225 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:02:54,225 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:02:54,225 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:02:54,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2018-11-10 13:02:54,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-10 13:02:54,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,254 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] [2018-11-10 13:02:54,254 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:02:54,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2018-11-10 13:02:54,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-10 13:02:54,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,257 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] [2018-11-10 13:02:54,262 INFO L793 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 33#L139-1true [2018-11-10 13:02:54,262 INFO L795 eck$LassoCheckResult]: Loop: 33#L139-1true assume true; 20#L36-1true assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L38true assume !(main_~cond~0 == 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; 29#L61true assume main_~p1~0 != 0;main_~lk1~0 := 1; 26#L61-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 12#L65-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 22#L69-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 8#L73-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 36#L77-1true assume main_~p6~0 != 0;main_~lk6~0 := 1; 25#L81-1true assume main_~p7~0 != 0;main_~lk7~0 := 1; 32#L85-1true assume !(main_~p8~0 != 0); 18#L89-1true assume main_~p9~0 != 0;main_~lk9~0 := 1; 5#L93-1true assume !(main_~p1~0 != 0); 37#L99-1true assume !(main_~p2~0 != 0); 6#L104-1true assume !(main_~p3~0 != 0); 15#L109-1true assume !(main_~p4~0 != 0); 28#L114-1true assume !(main_~p5~0 != 0); 35#L119-1true assume !(main_~p6~0 != 0); 3#L124-1true assume !(main_~p7~0 != 0); 13#L129-1true assume !(main_~p8~0 != 0); 24#L134-1true assume !(main_~p9~0 != 0); 33#L139-1true [2018-11-10 13:02:54,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 13:02:54,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,318 INFO L82 PathProgramCache]: Analyzing trace with hash -275404483, now seen corresponding path program 1 times [2018-11-10 13:02:54,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:02:54,378 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,393 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-11-10 13:02:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:54,418 INFO L93 Difference]: Finished difference Result 71 states and 120 transitions. [2018-11-10 13:02:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:54,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 120 transitions. [2018-11-10 13:02:54,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2018-11-10 13:02:54,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 61 states and 95 transitions. [2018-11-10 13:02:54,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-10 13:02:54,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 13:02:54,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 95 transitions. [2018-11-10 13:02:54,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:54,425 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 95 transitions. [2018-11-10 13:02:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 95 transitions. [2018-11-10 13:02:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-10 13:02:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 13:02:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 95 transitions. [2018-11-10 13:02:54,445 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 95 transitions. [2018-11-10 13:02:54,445 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 95 transitions. [2018-11-10 13:02:54,445 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:02:54,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 95 transitions. [2018-11-10 13:02:54,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2018-11-10 13:02:54,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,447 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] [2018-11-10 13:02:54,447 INFO L793 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 134#L139-1 [2018-11-10 13:02:54,447 INFO L795 eck$LassoCheckResult]: Loop: 134#L139-1 assume true; 162#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 161#L38 assume !(main_~cond~0 == 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; 160#L61 assume !(main_~p1~0 != 0); 146#L61-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 135#L65-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 136#L69-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 129#L73-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 130#L77-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 156#L81-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 155#L85-1 assume !(main_~p8~0 != 0); 154#L89-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 152#L93-1 assume !(main_~p1~0 != 0); 153#L99-1 assume !(main_~p2~0 != 0); 176#L104-1 assume !(main_~p3~0 != 0); 174#L109-1 assume !(main_~p4~0 != 0); 172#L114-1 assume !(main_~p5~0 != 0); 170#L119-1 assume !(main_~p6~0 != 0); 168#L124-1 assume !(main_~p7~0 != 0); 166#L129-1 assume !(main_~p8~0 != 0); 164#L134-1 assume !(main_~p9~0 != 0); 134#L139-1 [2018-11-10 13:02:54,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 13:02:54,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2025418107, now seen corresponding path program 1 times [2018-11-10 13:02:54,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:02:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:02:54,490 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,490 INFO L87 Difference]: Start difference. First operand 61 states and 95 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-10 13:02:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:54,511 INFO L93 Difference]: Finished difference Result 118 states and 182 transitions. [2018-11-10 13:02:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:54,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 182 transitions. [2018-11-10 13:02:54,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 116 [2018-11-10 13:02:54,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 182 transitions. [2018-11-10 13:02:54,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-10 13:02:54,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2018-11-10 13:02:54,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 182 transitions. [2018-11-10 13:02:54,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:54,516 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 182 transitions. [2018-11-10 13:02:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 182 transitions. [2018-11-10 13:02:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-10 13:02:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 13:02:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2018-11-10 13:02:54,523 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 182 transitions. [2018-11-10 13:02:54,523 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 182 transitions. [2018-11-10 13:02:54,523 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:02:54,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 182 transitions. [2018-11-10 13:02:54,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 116 [2018-11-10 13:02:54,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,525 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] [2018-11-10 13:02:54,525 INFO L793 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 319#L139-1 [2018-11-10 13:02:54,525 INFO L795 eck$LassoCheckResult]: Loop: 319#L139-1 assume true; 330#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 305#L38 assume !(main_~cond~0 == 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; 306#L61 assume !(main_~p1~0 != 0); 377#L61-2 assume !(main_~p2~0 != 0); 376#L65-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 375#L69-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 374#L73-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 373#L77-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 372#L81-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 371#L85-1 assume !(main_~p8~0 != 0); 370#L89-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 369#L93-1 assume !(main_~p1~0 != 0); 366#L99-1 assume !(main_~p2~0 != 0); 367#L104-1 assume !(main_~p3~0 != 0); 394#L109-1 assume !(main_~p4~0 != 0); 392#L114-1 assume !(main_~p5~0 != 0); 360#L119-1 assume !(main_~p6~0 != 0); 358#L124-1 assume !(main_~p7~0 != 0); 357#L129-1 assume !(main_~p8~0 != 0); 385#L134-1 assume !(main_~p9~0 != 0); 319#L139-1 [2018-11-10 13:02:54,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 13:02:54,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash 437070205, now seen corresponding path program 1 times [2018-11-10 13:02:54,529 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:02:54,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:02:54,549 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,549 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. cyclomatic complexity: 68 Second operand 3 states. [2018-11-10 13:02:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:54,575 INFO L93 Difference]: Finished difference Result 230 states and 350 transitions. [2018-11-10 13:02:54,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:54,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 350 transitions. [2018-11-10 13:02:54,578 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 228 [2018-11-10 13:02:54,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 350 transitions. [2018-11-10 13:02:54,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2018-11-10 13:02:54,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2018-11-10 13:02:54,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 350 transitions. [2018-11-10 13:02:54,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:54,581 INFO L705 BuchiCegarLoop]: Abstraction has 230 states and 350 transitions. [2018-11-10 13:02:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 350 transitions. [2018-11-10 13:02:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-11-10 13:02:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 13:02:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 350 transitions. [2018-11-10 13:02:54,590 INFO L728 BuchiCegarLoop]: Abstraction has 230 states and 350 transitions. [2018-11-10 13:02:54,590 INFO L608 BuchiCegarLoop]: Abstraction has 230 states and 350 transitions. [2018-11-10 13:02:54,590 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:02:54,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 350 transitions. [2018-11-10 13:02:54,592 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 228 [2018-11-10 13:02:54,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,593 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,593 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] [2018-11-10 13:02:54,594 INFO L793 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 671#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 672#L139-1 [2018-11-10 13:02:54,594 INFO L795 eck$LassoCheckResult]: Loop: 672#L139-1 assume true; 760#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 758#L38 assume !(main_~cond~0 == 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; 755#L61 assume !(main_~p1~0 != 0); 756#L61-2 assume !(main_~p2~0 != 0); 744#L65-1 assume !(main_~p3~0 != 0); 746#L69-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 738#L73-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 739#L77-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 732#L81-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 733#L85-1 assume !(main_~p8~0 != 0); 726#L89-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 727#L93-1 assume !(main_~p1~0 != 0); 788#L99-1 assume !(main_~p2~0 != 0); 787#L104-1 assume !(main_~p3~0 != 0); 785#L109-1 assume !(main_~p4~0 != 0); 781#L114-1 assume !(main_~p5~0 != 0); 777#L119-1 assume !(main_~p6~0 != 0); 773#L124-1 assume !(main_~p7~0 != 0); 769#L129-1 assume !(main_~p8~0 != 0); 765#L134-1 assume !(main_~p9~0 != 0); 672#L139-1 [2018-11-10 13:02:54,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 13:02:54,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash -583998149, now seen corresponding path program 1 times [2018-11-10 13:02:54,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:02:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:02:54,625 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,626 INFO L87 Difference]: Start difference. First operand 230 states and 350 transitions. cyclomatic complexity: 128 Second operand 3 states. [2018-11-10 13:02:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:54,649 INFO L93 Difference]: Finished difference Result 450 states and 674 transitions. [2018-11-10 13:02:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:54,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 674 transitions. [2018-11-10 13:02:54,652 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 448 [2018-11-10 13:02:54,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 450 states and 674 transitions. [2018-11-10 13:02:54,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2018-11-10 13:02:54,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2018-11-10 13:02:54,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 450 states and 674 transitions. [2018-11-10 13:02:54,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:54,658 INFO L705 BuchiCegarLoop]: Abstraction has 450 states and 674 transitions. [2018-11-10 13:02:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states and 674 transitions. [2018-11-10 13:02:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2018-11-10 13:02:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-10 13:02:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 674 transitions. [2018-11-10 13:02:54,673 INFO L728 BuchiCegarLoop]: Abstraction has 450 states and 674 transitions. [2018-11-10 13:02:54,673 INFO L608 BuchiCegarLoop]: Abstraction has 450 states and 674 transitions. [2018-11-10 13:02:54,674 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:02:54,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 674 transitions. [2018-11-10 13:02:54,676 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 448 [2018-11-10 13:02:54,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,676 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] [2018-11-10 13:02:54,676 INFO L793 eck$LassoCheckResult]: Stem: 1383#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 1358#L139-1 [2018-11-10 13:02:54,676 INFO L795 eck$LassoCheckResult]: Loop: 1358#L139-1 assume true; 1431#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 1429#L38 assume !(main_~cond~0 == 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; 1426#L61 assume !(main_~p1~0 != 0); 1422#L61-2 assume !(main_~p2~0 != 0); 1418#L65-1 assume !(main_~p3~0 != 0); 1415#L69-1 assume !(main_~p4~0 != 0); 1413#L73-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 1411#L77-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 1409#L81-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 1407#L85-1 assume !(main_~p8~0 != 0); 1405#L89-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 1402#L93-1 assume !(main_~p1~0 != 0); 1403#L99-1 assume !(main_~p2~0 != 0); 1455#L104-1 assume !(main_~p3~0 != 0); 1451#L109-1 assume !(main_~p4~0 != 0); 1448#L114-1 assume !(main_~p5~0 != 0); 1446#L119-1 assume !(main_~p6~0 != 0); 1442#L124-1 assume !(main_~p7~0 != 0); 1438#L129-1 assume !(main_~p8~0 != 0); 1435#L134-1 assume !(main_~p9~0 != 0); 1358#L139-1 [2018-11-10 13:02:54,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 13:02:54,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1863861827, now seen corresponding path program 1 times [2018-11-10 13:02:54,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:02:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:02:54,692 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,693 INFO L87 Difference]: Start difference. First operand 450 states and 674 transitions. cyclomatic complexity: 240 Second operand 3 states. [2018-11-10 13:02:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:54,716 INFO L93 Difference]: Finished difference Result 882 states and 1298 transitions. [2018-11-10 13:02:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:54,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 882 states and 1298 transitions. [2018-11-10 13:02:54,722 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 880 [2018-11-10 13:02:54,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 882 states to 882 states and 1298 transitions. [2018-11-10 13:02:54,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 882 [2018-11-10 13:02:54,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 882 [2018-11-10 13:02:54,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 882 states and 1298 transitions. [2018-11-10 13:02:54,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:54,729 INFO L705 BuchiCegarLoop]: Abstraction has 882 states and 1298 transitions. [2018-11-10 13:02:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states and 1298 transitions. [2018-11-10 13:02:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2018-11-10 13:02:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-10 13:02:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1298 transitions. [2018-11-10 13:02:54,747 INFO L728 BuchiCegarLoop]: Abstraction has 882 states and 1298 transitions. [2018-11-10 13:02:54,747 INFO L608 BuchiCegarLoop]: Abstraction has 882 states and 1298 transitions. [2018-11-10 13:02:54,747 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 13:02:54,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 882 states and 1298 transitions. [2018-11-10 13:02:54,752 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 880 [2018-11-10 13:02:54,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,753 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] [2018-11-10 13:02:54,753 INFO L793 eck$LassoCheckResult]: Stem: 2720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 2696#L139-1 [2018-11-10 13:02:54,753 INFO L795 eck$LassoCheckResult]: Loop: 2696#L139-1 assume true; 2784#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 2782#L38 assume !(main_~cond~0 == 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; 2779#L61 assume !(main_~p1~0 != 0); 2775#L61-2 assume !(main_~p2~0 != 0); 2771#L65-1 assume !(main_~p3~0 != 0); 2767#L69-1 assume !(main_~p4~0 != 0); 2761#L73-1 assume !(main_~p5~0 != 0); 2762#L77-1 assume main_~p6~0 != 0;main_~lk6~0 := 1; 2752#L81-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 2753#L85-1 assume !(main_~p8~0 != 0); 2745#L89-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 2746#L93-1 assume !(main_~p1~0 != 0); 2811#L99-1 assume !(main_~p2~0 != 0); 2807#L104-1 assume !(main_~p3~0 != 0); 2804#L109-1 assume !(main_~p4~0 != 0); 2802#L114-1 assume !(main_~p5~0 != 0); 2799#L119-1 assume !(main_~p6~0 != 0); 2795#L124-1 assume !(main_~p7~0 != 0); 2791#L129-1 assume !(main_~p8~0 != 0); 2789#L134-1 assume !(main_~p9~0 != 0); 2696#L139-1 [2018-11-10 13:02:54,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 13:02:54,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1419988219, now seen corresponding path program 1 times [2018-11-10 13:02:54,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:02:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:02:54,775 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,775 INFO L87 Difference]: Start difference. First operand 882 states and 1298 transitions. cyclomatic complexity: 448 Second operand 3 states. [2018-11-10 13:02:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:54,806 INFO L93 Difference]: Finished difference Result 1730 states and 2498 transitions. [2018-11-10 13:02:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:54,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1730 states and 2498 transitions. [2018-11-10 13:02:54,817 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1728 [2018-11-10 13:02:54,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1730 states to 1730 states and 2498 transitions. [2018-11-10 13:02:54,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1730 [2018-11-10 13:02:54,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1730 [2018-11-10 13:02:54,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1730 states and 2498 transitions. [2018-11-10 13:02:54,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:54,825 INFO L705 BuchiCegarLoop]: Abstraction has 1730 states and 2498 transitions. [2018-11-10 13:02:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states and 2498 transitions. [2018-11-10 13:02:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1730. [2018-11-10 13:02:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2018-11-10 13:02:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2498 transitions. [2018-11-10 13:02:54,844 INFO L728 BuchiCegarLoop]: Abstraction has 1730 states and 2498 transitions. [2018-11-10 13:02:54,844 INFO L608 BuchiCegarLoop]: Abstraction has 1730 states and 2498 transitions. [2018-11-10 13:02:54,844 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 13:02:54,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1730 states and 2498 transitions. [2018-11-10 13:02:54,849 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1728 [2018-11-10 13:02:54,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,850 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] [2018-11-10 13:02:54,850 INFO L793 eck$LassoCheckResult]: Stem: 5339#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 5314#L139-1 [2018-11-10 13:02:54,850 INFO L795 eck$LassoCheckResult]: Loop: 5314#L139-1 assume true; 5403#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 5401#L38 assume !(main_~cond~0 == 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; 5398#L61 assume !(main_~p1~0 != 0); 5395#L61-2 assume !(main_~p2~0 != 0); 5391#L65-1 assume !(main_~p3~0 != 0); 5387#L69-1 assume !(main_~p4~0 != 0); 5388#L73-1 assume !(main_~p5~0 != 0); 5446#L77-1 assume !(main_~p6~0 != 0); 5444#L81-1 assume main_~p7~0 != 0;main_~lk7~0 := 1; 5442#L85-1 assume !(main_~p8~0 != 0); 5440#L89-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 5437#L93-1 assume !(main_~p1~0 != 0); 5433#L99-1 assume !(main_~p2~0 != 0); 5429#L104-1 assume !(main_~p3~0 != 0); 5425#L109-1 assume !(main_~p4~0 != 0); 5421#L114-1 assume !(main_~p5~0 != 0); 5418#L119-1 assume !(main_~p6~0 != 0); 5416#L124-1 assume !(main_~p7~0 != 0); 5413#L129-1 assume !(main_~p8~0 != 0); 5409#L134-1 assume !(main_~p9~0 != 0); 5314#L139-1 [2018-11-10 13:02:54,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 13:02:54,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash 833182205, now seen corresponding path program 1 times [2018-11-10 13:02:54,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:02:54,873 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,874 INFO L87 Difference]: Start difference. First operand 1730 states and 2498 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-11-10 13:02:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:54,899 INFO L93 Difference]: Finished difference Result 3394 states and 4802 transitions. [2018-11-10 13:02:54,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:54,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3394 states and 4802 transitions. [2018-11-10 13:02:54,912 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3392 [2018-11-10 13:02:54,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3394 states to 3394 states and 4802 transitions. [2018-11-10 13:02:54,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3394 [2018-11-10 13:02:54,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3394 [2018-11-10 13:02:54,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3394 states and 4802 transitions. [2018-11-10 13:02:54,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:54,925 INFO L705 BuchiCegarLoop]: Abstraction has 3394 states and 4802 transitions. [2018-11-10 13:02:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states and 4802 transitions. [2018-11-10 13:02:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3394. [2018-11-10 13:02:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3394 states. [2018-11-10 13:02:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4802 transitions. [2018-11-10 13:02:54,963 INFO L728 BuchiCegarLoop]: Abstraction has 3394 states and 4802 transitions. [2018-11-10 13:02:54,963 INFO L608 BuchiCegarLoop]: Abstraction has 3394 states and 4802 transitions. [2018-11-10 13:02:54,963 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 13:02:54,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3394 states and 4802 transitions. [2018-11-10 13:02:54,973 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3392 [2018-11-10 13:02:54,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:54,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:54,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:54,974 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] [2018-11-10 13:02:54,974 INFO L793 eck$LassoCheckResult]: Stem: 10470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 10443#L139-1 [2018-11-10 13:02:54,974 INFO L795 eck$LassoCheckResult]: Loop: 10443#L139-1 assume true; 10714#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 10712#L38 assume !(main_~cond~0 == 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; 10709#L61 assume !(main_~p1~0 != 0); 10705#L61-2 assume !(main_~p2~0 != 0); 10701#L65-1 assume !(main_~p3~0 != 0); 10697#L69-1 assume !(main_~p4~0 != 0); 10693#L73-1 assume !(main_~p5~0 != 0); 10689#L77-1 assume !(main_~p6~0 != 0); 10690#L81-1 assume !(main_~p7~0 != 0); 10751#L85-1 assume !(main_~p8~0 != 0); 10749#L89-1 assume main_~p9~0 != 0;main_~lk9~0 := 1; 10745#L93-1 assume !(main_~p1~0 != 0); 10740#L99-1 assume !(main_~p2~0 != 0); 10735#L104-1 assume !(main_~p3~0 != 0); 10731#L109-1 assume !(main_~p4~0 != 0); 10728#L114-1 assume !(main_~p5~0 != 0); 10726#L119-1 assume !(main_~p6~0 != 0); 10724#L124-1 assume !(main_~p7~0 != 0); 10723#L129-1 assume !(main_~p8~0 != 0); 10719#L134-1 assume !(main_~p9~0 != 0); 10443#L139-1 [2018-11-10 13:02:54,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-10 13:02:54,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:54,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:54,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1091347643, now seen corresponding path program 1 times [2018-11-10 13:02:54,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:54,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:54,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:02:54,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:02:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:02:54,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:02:54,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:02:54,994 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:02:54,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:02:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:02:54,994 INFO L87 Difference]: Start difference. First operand 3394 states and 4802 transitions. cyclomatic complexity: 1536 Second operand 3 states. [2018-11-10 13:02:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:02:55,037 INFO L93 Difference]: Finished difference Result 6658 states and 9218 transitions. [2018-11-10 13:02:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:02:55,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6658 states and 9218 transitions. [2018-11-10 13:02:55,062 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6656 [2018-11-10 13:02:55,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6658 states to 6658 states and 9218 transitions. [2018-11-10 13:02:55,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6658 [2018-11-10 13:02:55,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6658 [2018-11-10 13:02:55,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6658 states and 9218 transitions. [2018-11-10 13:02:55,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:02:55,087 INFO L705 BuchiCegarLoop]: Abstraction has 6658 states and 9218 transitions. [2018-11-10 13:02:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states and 9218 transitions. [2018-11-10 13:02:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 6658. [2018-11-10 13:02:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2018-11-10 13:02:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 9218 transitions. [2018-11-10 13:02:55,157 INFO L728 BuchiCegarLoop]: Abstraction has 6658 states and 9218 transitions. [2018-11-10 13:02:55,157 INFO L608 BuchiCegarLoop]: Abstraction has 6658 states and 9218 transitions. [2018-11-10 13:02:55,157 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 13:02:55,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6658 states and 9218 transitions. [2018-11-10 13:02:55,173 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6656 [2018-11-10 13:02:55,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:02:55,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:02:55,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:02:55,173 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] [2018-11-10 13:02:55,174 INFO L793 eck$LassoCheckResult]: Stem: 20527#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20500#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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_~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_~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;havoc main_~cond~0; 20501#L139-1 [2018-11-10 13:02:55,174 INFO L795 eck$LassoCheckResult]: Loop: 20501#L139-1 assume true; 20761#L36-1 assume !false;main_~cond~0 := main_#t~nondet9;havoc main_#t~nondet9; 20759#L38 assume !(main_~cond~0 == 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; 20755#L61 assume !(main_~p1~0 != 0); 20751#L61-2 assume !(main_~p2~0 != 0); 20747#L65-1 assume !(main_~p3~0 != 0); 20743#L69-1 assume !(main_~p4~0 != 0); 20739#L73-1 assume !(main_~p5~0 != 0); 20736#L77-1 assume !(main_~p6~0 != 0); 20737#L81-1 assume !(main_~p7~0 != 0); 20803#L85-1 assume !(main_~p8~0 != 0); 20800#L89-1 assume !(main_~p9~0 != 0); 20679#L93-1 assume !(main_~p1~0 != 0); 20680#L99-1 assume !(main_~p2~0 != 0); 20786#L104-1 assume !(main_~p3~0 != 0); 20782#L109-1 assume !(main_~p4~0 != 0); 20777#L114-1 assume !(main_~p5~0 != 0); 20774#L119-1 assume !(main_~p6~0 != 0); 20772#L124-1 assume !(main_~p7~0 != 0); 20769#L129-1 assume !(main_~p8~0 != 0); 20764#L134-1 assume !(main_~p9~0 != 0); 20501#L139-1 [2018-11-10 13:02:55,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-10 13:02:55,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:55,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:55,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:55,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:55,177 INFO L82 PathProgramCache]: Analyzing trace with hash 698320633, now seen corresponding path program 1 times [2018-11-10 13:02:55,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:55,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:55,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:02:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:55,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:02:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1406742409, now seen corresponding path program 1 times [2018-11-10 13:02:55,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:02:55,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:02:55,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:55,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:02:55,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:02:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:02:55,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:02:55 BoogieIcfgContainer [2018-11-10 13:02:55,313 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:02:55,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:02:55,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:02:55,314 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:02:55,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:02:54" (3/4) ... [2018-11-10 13:02:55,316 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 13:02:55,350 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f0448c50-28d7-4661-8e50-f1c57aa86a98/bin-2019/uautomizer/witness.graphml [2018-11-10 13:02:55,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:02:55,351 INFO L168 Benchmark]: Toolchain (without parser) took 1621.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 959.2 MB in the beginning and 889.1 MB in the end (delta: 70.1 MB). Peak memory consumption was 238.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:55,352 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:55,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.92 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:55,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:55,352 INFO L168 Benchmark]: Boogie Preprocessor took 14.76 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:02:55,352 INFO L168 Benchmark]: RCFGBuilder took 236.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:55,353 INFO L168 Benchmark]: BuchiAutomizer took 1137.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 252.8 MB). Peak memory consumption was 252.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:55,353 INFO L168 Benchmark]: Witness Printer took 36.22 ms. Allocated memory is still 1.2 GB. Free memory was 892.4 MB in the beginning and 889.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:02:55,355 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.92 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.76 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1137.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 252.8 MB). Peak memory consumption was 252.8 MB. Max. memory is 11.5 GB. * Witness Printer took 36.22 ms. Allocated memory is still 1.2 GB. Free memory was 892.4 MB in the beginning and 889.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6658 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 6658 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 604 SDtfs, 309 SDslu, 364 SDs, 0 SdLazy, 40 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 36]: 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, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22344fc0=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40f9b9d8=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2922eec6=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5547fe30=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c03c583=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15d1dfc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48e88e93=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76cbe4c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64c33c1b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@404127bb=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 36]: 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; [L34] int cond; Loop: [L36] COND TRUE 1 [L37] cond = __VERIFIER_nondet_int() [L38] COND FALSE !(cond == 0) [L41] lk1 = 0 [L43] lk2 = 0 [L45] lk3 = 0 [L47] lk4 = 0 [L49] lk5 = 0 [L51] lk6 = 0 [L53] lk7 = 0 [L55] lk8 = 0 [L57] lk9 = 0 [L61] COND FALSE !(p1 != 0) [L65] COND FALSE !(p2 != 0) [L69] COND FALSE !(p3 != 0) [L73] COND FALSE !(p4 != 0) [L77] COND FALSE !(p5 != 0) [L81] COND FALSE !(p6 != 0) [L85] COND FALSE !(p7 != 0) [L89] COND FALSE !(p8 != 0) [L93] COND FALSE !(p9 != 0) [L99] COND FALSE !(p1 != 0) [L104] COND FALSE !(p2 != 0) [L109] COND FALSE !(p3 != 0) [L114] COND FALSE !(p4 != 0) [L119] COND FALSE !(p5 != 0) [L124] COND FALSE !(p6 != 0) [L129] COND FALSE !(p7 != 0) [L134] COND FALSE !(p8 != 0) [L139] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...