./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f2cbbf56a13532141372a32a461d64a9d1351c0e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-0ed9222-m [2019-01-14 02:54:59,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:54:59,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:54:59,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:54:59,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:54:59,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:54:59,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:54:59,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:54:59,441 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:54:59,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:54:59,444 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:54:59,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:54:59,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:54:59,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:54:59,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:54:59,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:54:59,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:54:59,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:54:59,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:54:59,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:54:59,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:54:59,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:54:59,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:54:59,461 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:54:59,461 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:54:59,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:54:59,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:54:59,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:54:59,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:54:59,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:54:59,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:54:59,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:54:59,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:54:59,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:54:59,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:54:59,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:54:59,471 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:54:59,491 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:54:59,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:54:59,495 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:54:59,495 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:54:59,495 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:54:59,496 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:54:59,498 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:54:59,498 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:54:59,498 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:54:59,498 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:54:59,498 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:54:59,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:54:59,500 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:54:59,500 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:54:59,500 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:54:59,500 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:54:59,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:54:59,501 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:54:59,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:54:59,501 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:54:59,501 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:54:59,501 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:54:59,501 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:54:59,504 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:54:59,504 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:54:59,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:54:59,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:54:59,505 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:54:59,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:54:59,505 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:54:59,505 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:54:59,508 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:54:59,509 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-01-14 02:54:59,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:54:59,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:54:59,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:54:59,600 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:54:59,600 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:54:59,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:59,668 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45112bdca/a68ae96000094d85b088643da948daf0/FLAG7446b590d [2019-01-14 02:55:00,181 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:55:00,182 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:55:00,189 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45112bdca/a68ae96000094d85b088643da948daf0/FLAG7446b590d [2019-01-14 02:55:00,527 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45112bdca/a68ae96000094d85b088643da948daf0 [2019-01-14 02:55:00,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:55:00,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:55:00,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:55:00,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:55:00,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:55:00,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@978ea28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00, skipping insertion in model container [2019-01-14 02:55:00,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:55:00,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:55:00,751 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:55:00,755 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:55:00,780 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:55:00,794 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:55:00,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00 WrapperNode [2019-01-14 02:55:00,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:55:00,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:55:00,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:55:00,797 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:55:00,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:55:00,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:55:00,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:55:00,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:55:00,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... [2019-01-14 02:55:00,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:55:00,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:55:00,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:55:00,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:55:00,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:55:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:55:01,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:55:01,527 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:55:01,527 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:55:01,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:01 BoogieIcfgContainer [2019-01-14 02:55:01,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:55:01,529 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:55:01,529 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:55:01,533 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:55:01,534 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:01,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:55:00" (1/3) ... [2019-01-14 02:55:01,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67e66d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:55:01, skipping insertion in model container [2019-01-14 02:55:01,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:01,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:55:00" (2/3) ... [2019-01-14 02:55:01,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67e66d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:55:01, skipping insertion in model container [2019-01-14 02:55:01,536 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:55:01,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:01" (3/3) ... [2019-01-14 02:55:01,538 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:55:01,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:55:01,599 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:55:01,599 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:55:01,599 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:55:01,599 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:55:01,599 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:55:01,600 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:55:01,600 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:55:01,600 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:55:01,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2019-01-14 02:55:01,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-01-14 02:55:01,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:01,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:01,647 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:01,648 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:01,648 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:55:01,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2019-01-14 02:55:01,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-01-14 02:55:01,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:01,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:01,653 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:01,653 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:01,660 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 23#L125-1true [2019-01-14 02:55:01,661 INFO L796 eck$LassoCheckResult]: Loop: 23#L125-1true assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 31#L35true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 17#L56true assume 0 != main_~p1~0;main_~lk1~0 := 1; 14#L56-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 5#L60-1true assume !(0 != main_~p3~0); 27#L64-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 32#L68-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 24#L72-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L76-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 3#L80-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 9#L84-1true assume !(0 != main_~p1~0); 33#L90-1true assume !(0 != main_~p2~0); 10#L95-1true assume !(0 != main_~p3~0); 20#L100-1true assume !(0 != main_~p4~0); 25#L105-1true assume !(0 != main_~p5~0); 30#L110-1true assume !(0 != main_~p6~0); 7#L115-1true assume !(0 != main_~p7~0); 16#L120-1true assume !(0 != main_~p8~0); 23#L125-1true [2019-01-14 02:55:01,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:01,667 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:55:01,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:01,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1556343304, now seen corresponding path program 1 times [2019-01-14 02:55:01,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:01,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:01,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:01,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:01,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:01,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:01,854 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:01,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:01,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:01,871 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-01-14 02:55:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:01,923 INFO L93 Difference]: Finished difference Result 62 states and 105 transitions. [2019-01-14 02:55:01,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:01,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 105 transitions. [2019-01-14 02:55:01,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 02:55:01,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 52 states and 82 transitions. [2019-01-14 02:55:01,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-14 02:55:01,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-14 02:55:01,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 82 transitions. [2019-01-14 02:55:01,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:01,939 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2019-01-14 02:55:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 82 transitions. [2019-01-14 02:55:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-14 02:55:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 02:55:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2019-01-14 02:55:01,977 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2019-01-14 02:55:01,977 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2019-01-14 02:55:01,977 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:55:01,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 82 transitions. [2019-01-14 02:55:01,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 02:55:01,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:01,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:01,981 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:01,981 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:01,981 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 118#L125-1 [2019-01-14 02:55:01,981 INFO L796 eck$LassoCheckResult]: Loop: 118#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 126#L35 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 136#L56 assume !(0 != main_~p1~0); 137#L56-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 154#L60-1 assume !(0 != main_~p3~0); 153#L64-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 152#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 151#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 150#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 148#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 134#L84-1 assume !(0 != main_~p1~0); 135#L90-1 assume !(0 != main_~p2~0); 147#L95-1 assume !(0 != main_~p3~0); 145#L100-1 assume !(0 != main_~p4~0); 128#L105-1 assume !(0 != main_~p5~0); 106#L110-1 assume !(0 != main_~p6~0); 141#L115-1 assume !(0 != main_~p7~0); 122#L120-1 assume !(0 != main_~p8~0); 118#L125-1 [2019-01-14 02:55:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:55:01,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash 535274950, now seen corresponding path program 1 times [2019-01-14 02:55:02,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:02,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,130 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,131 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. cyclomatic complexity: 32 Second operand 3 states. [2019-01-14 02:55:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,236 INFO L93 Difference]: Finished difference Result 101 states and 157 transitions. [2019-01-14 02:55:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 157 transitions. [2019-01-14 02:55:02,241 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2019-01-14 02:55:02,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 157 transitions. [2019-01-14 02:55:02,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 02:55:02,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 02:55:02,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 157 transitions. [2019-01-14 02:55:02,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,245 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2019-01-14 02:55:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 157 transitions. [2019-01-14 02:55:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 02:55:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 02:55:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2019-01-14 02:55:02,258 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2019-01-14 02:55:02,258 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2019-01-14 02:55:02,258 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:55:02,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 157 transitions. [2019-01-14 02:55:02,260 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2019-01-14 02:55:02,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,261 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,261 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,262 INFO L794 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 293#L125-1 [2019-01-14 02:55:02,262 INFO L796 eck$LassoCheckResult]: Loop: 293#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 335#L35 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 334#L56 assume !(0 != main_~p1~0); 333#L56-2 assume !(0 != main_~p2~0); 332#L60-1 assume !(0 != main_~p3~0); 323#L64-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 324#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 313#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 314#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 307#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 308#L84-1 assume !(0 != main_~p1~0); 331#L90-1 assume !(0 != main_~p2~0); 327#L95-1 assume !(0 != main_~p3~0); 326#L100-1 assume !(0 != main_~p4~0); 317#L105-1 assume !(0 != main_~p5~0); 316#L110-1 assume !(0 != main_~p6~0); 339#L115-1 assume !(0 != main_~p7~0); 337#L120-1 assume !(0 != main_~p8~0); 293#L125-1 [2019-01-14 02:55:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:55:02,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash -744588728, now seen corresponding path program 1 times [2019-01-14 02:55:02,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:02,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,344 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,346 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-01-14 02:55:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,415 INFO L93 Difference]: Finished difference Result 197 states and 301 transitions. [2019-01-14 02:55:02,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 301 transitions. [2019-01-14 02:55:02,420 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2019-01-14 02:55:02,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 301 transitions. [2019-01-14 02:55:02,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2019-01-14 02:55:02,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2019-01-14 02:55:02,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 301 transitions. [2019-01-14 02:55:02,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,426 INFO L706 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2019-01-14 02:55:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 301 transitions. [2019-01-14 02:55:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-14 02:55:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-14 02:55:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 301 transitions. [2019-01-14 02:55:02,445 INFO L729 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2019-01-14 02:55:02,445 INFO L609 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2019-01-14 02:55:02,445 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:55:02,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 301 transitions. [2019-01-14 02:55:02,448 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2019-01-14 02:55:02,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,448 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,449 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,449 INFO L794 eck$LassoCheckResult]: Stem: 599#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 600#L125-1 [2019-01-14 02:55:02,449 INFO L796 eck$LassoCheckResult]: Loop: 600#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 628#L35 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 625#L56 assume !(0 != main_~p1~0); 626#L56-2 assume !(0 != main_~p2~0); 673#L60-1 assume !(0 != main_~p3~0); 670#L64-1 assume !(0 != main_~p4~0); 668#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 666#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 664#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 662#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 660#L84-1 assume !(0 != main_~p1~0); 657#L90-1 assume !(0 != main_~p2~0); 654#L95-1 assume !(0 != main_~p3~0); 649#L100-1 assume !(0 != main_~p4~0); 646#L105-1 assume !(0 != main_~p5~0); 641#L110-1 assume !(0 != main_~p6~0); 638#L115-1 assume !(0 != main_~p7~0); 632#L120-1 assume !(0 != main_~p8~0); 600#L125-1 [2019-01-14 02:55:02,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-14 02:55:02,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1331394742, now seen corresponding path program 1 times [2019-01-14 02:55:02,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:02,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,525 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,526 INFO L87 Difference]: Start difference. First operand 197 states and 301 transitions. cyclomatic complexity: 112 Second operand 3 states. [2019-01-14 02:55:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,609 INFO L93 Difference]: Finished difference Result 385 states and 577 transitions. [2019-01-14 02:55:02,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 385 states and 577 transitions. [2019-01-14 02:55:02,615 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2019-01-14 02:55:02,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 385 states to 385 states and 577 transitions. [2019-01-14 02:55:02,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2019-01-14 02:55:02,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2019-01-14 02:55:02,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 577 transitions. [2019-01-14 02:55:02,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,624 INFO L706 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2019-01-14 02:55:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 577 transitions. [2019-01-14 02:55:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-01-14 02:55:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-01-14 02:55:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 577 transitions. [2019-01-14 02:55:02,648 INFO L729 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2019-01-14 02:55:02,648 INFO L609 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2019-01-14 02:55:02,649 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:55:02,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 577 transitions. [2019-01-14 02:55:02,652 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2019-01-14 02:55:02,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,653 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,653 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,654 INFO L794 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 1187#L125-1 [2019-01-14 02:55:02,654 INFO L796 eck$LassoCheckResult]: Loop: 1187#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 1232#L35 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 1230#L56 assume !(0 != main_~p1~0); 1226#L56-2 assume !(0 != main_~p2~0); 1224#L60-1 assume !(0 != main_~p3~0); 1220#L64-1 assume !(0 != main_~p4~0); 1216#L68-1 assume !(0 != main_~p5~0); 1214#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1212#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1210#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1207#L84-1 assume !(0 != main_~p1~0); 1208#L90-1 assume !(0 != main_~p2~0); 1256#L95-1 assume !(0 != main_~p3~0); 1251#L100-1 assume !(0 != main_~p4~0); 1247#L105-1 assume !(0 != main_~p5~0); 1243#L110-1 assume !(0 != main_~p6~0); 1240#L115-1 assume !(0 != main_~p7~0); 1236#L120-1 assume !(0 != main_~p8~0); 1187#L125-1 [2019-01-14 02:55:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,654 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-14 02:55:02,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1073229304, now seen corresponding path program 1 times [2019-01-14 02:55:02,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:02,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,692 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,693 INFO L87 Difference]: Start difference. First operand 385 states and 577 transitions. cyclomatic complexity: 208 Second operand 3 states. [2019-01-14 02:55:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:02,780 INFO L93 Difference]: Finished difference Result 753 states and 1105 transitions. [2019-01-14 02:55:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:02,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 753 states and 1105 transitions. [2019-01-14 02:55:02,794 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2019-01-14 02:55:02,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 753 states to 753 states and 1105 transitions. [2019-01-14 02:55:02,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 753 [2019-01-14 02:55:02,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 753 [2019-01-14 02:55:02,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 753 states and 1105 transitions. [2019-01-14 02:55:02,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:02,808 INFO L706 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2019-01-14 02:55:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states and 1105 transitions. [2019-01-14 02:55:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2019-01-14 02:55:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-01-14 02:55:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1105 transitions. [2019-01-14 02:55:02,854 INFO L729 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2019-01-14 02:55:02,854 INFO L609 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2019-01-14 02:55:02,854 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:55:02,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 753 states and 1105 transitions. [2019-01-14 02:55:02,863 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2019-01-14 02:55:02,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:02,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:02,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:02,867 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:02,868 INFO L794 eck$LassoCheckResult]: Stem: 2335#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 2336#L125-1 [2019-01-14 02:55:02,868 INFO L796 eck$LassoCheckResult]: Loop: 2336#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 2400#L35 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 2398#L56 assume !(0 != main_~p1~0); 2394#L56-2 assume !(0 != main_~p2~0); 2392#L60-1 assume !(0 != main_~p3~0); 2388#L64-1 assume !(0 != main_~p4~0); 2384#L68-1 assume !(0 != main_~p5~0); 2380#L72-1 assume !(0 != main_~p6~0); 2378#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2376#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2373#L84-1 assume !(0 != main_~p1~0); 2374#L90-1 assume !(0 != main_~p2~0); 2424#L95-1 assume !(0 != main_~p3~0); 2419#L100-1 assume !(0 != main_~p4~0); 2415#L105-1 assume !(0 != main_~p5~0); 2411#L110-1 assume !(0 != main_~p6~0); 2408#L115-1 assume !(0 != main_~p7~0); 2404#L120-1 assume !(0 != main_~p8~0); 2336#L125-1 [2019-01-14 02:55:02,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-14 02:55:02,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:02,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:02,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash -372164726, now seen corresponding path program 1 times [2019-01-14 02:55:02,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:02,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:02,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:55:02,940 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:02,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:02,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:02,942 INFO L87 Difference]: Start difference. First operand 753 states and 1105 transitions. cyclomatic complexity: 384 Second operand 3 states. [2019-01-14 02:55:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:03,040 INFO L93 Difference]: Finished difference Result 1473 states and 2113 transitions. [2019-01-14 02:55:03,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:03,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1473 states and 2113 transitions. [2019-01-14 02:55:03,061 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2019-01-14 02:55:03,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1473 states to 1473 states and 2113 transitions. [2019-01-14 02:55:03,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1473 [2019-01-14 02:55:03,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1473 [2019-01-14 02:55:03,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1473 states and 2113 transitions. [2019-01-14 02:55:03,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:03,080 INFO L706 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2019-01-14 02:55:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states and 2113 transitions. [2019-01-14 02:55:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2019-01-14 02:55:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-01-14 02:55:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2113 transitions. [2019-01-14 02:55:03,119 INFO L729 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2019-01-14 02:55:03,119 INFO L609 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2019-01-14 02:55:03,119 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:55:03,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1473 states and 2113 transitions. [2019-01-14 02:55:03,132 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2019-01-14 02:55:03,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:03,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:03,134 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:03,134 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:03,135 INFO L794 eck$LassoCheckResult]: Stem: 4563#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 4564#L125-1 [2019-01-14 02:55:03,136 INFO L796 eck$LassoCheckResult]: Loop: 4564#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 4910#L35 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 4907#L56 assume !(0 != main_~p1~0); 4903#L56-2 assume !(0 != main_~p2~0); 4900#L60-1 assume !(0 != main_~p3~0); 4897#L64-1 assume !(0 != main_~p4~0); 4898#L68-1 assume !(0 != main_~p5~0); 4889#L72-1 assume !(0 != main_~p6~0); 4891#L76-1 assume !(0 != main_~p7~0); 4929#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4927#L84-1 assume !(0 != main_~p1~0); 4926#L90-1 assume !(0 != main_~p2~0); 4925#L95-1 assume !(0 != main_~p3~0); 4923#L100-1 assume !(0 != main_~p4~0); 4922#L105-1 assume !(0 != main_~p5~0); 4920#L110-1 assume !(0 != main_~p6~0); 4917#L115-1 assume !(0 != main_~p7~0); 4915#L120-1 assume !(0 != main_~p8~0); 4564#L125-1 [2019-01-14 02:55:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-14 02:55:03,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:03,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash -765191736, now seen corresponding path program 1 times [2019-01-14 02:55:03,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:03,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:55:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:55:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:55:03,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:55:03,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:55:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:55:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:55:03,202 INFO L87 Difference]: Start difference. First operand 1473 states and 2113 transitions. cyclomatic complexity: 704 Second operand 3 states. [2019-01-14 02:55:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:55:03,308 INFO L93 Difference]: Finished difference Result 2881 states and 4033 transitions. [2019-01-14 02:55:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:55:03,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2881 states and 4033 transitions. [2019-01-14 02:55:03,341 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2019-01-14 02:55:03,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2881 states to 2881 states and 4033 transitions. [2019-01-14 02:55:03,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2881 [2019-01-14 02:55:03,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2881 [2019-01-14 02:55:03,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2881 states and 4033 transitions. [2019-01-14 02:55:03,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:55:03,381 INFO L706 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2019-01-14 02:55:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states and 4033 transitions. [2019-01-14 02:55:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2881. [2019-01-14 02:55:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-01-14 02:55:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4033 transitions. [2019-01-14 02:55:03,486 INFO L729 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2019-01-14 02:55:03,486 INFO L609 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2019-01-14 02:55:03,487 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:55:03,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2881 states and 4033 transitions. [2019-01-14 02:55:03,524 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2019-01-14 02:55:03,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:55:03,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:55:03,525 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:55:03,527 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:55:03,527 INFO L794 eck$LassoCheckResult]: Stem: 8923#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_~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_~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;havoc main_~cond~0; 8924#L125-1 [2019-01-14 02:55:03,527 INFO L796 eck$LassoCheckResult]: Loop: 8924#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 9159#L35 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 9153#L56 assume !(0 != main_~p1~0); 9149#L56-2 assume !(0 != main_~p2~0); 9148#L60-1 assume !(0 != main_~p3~0); 9145#L64-1 assume !(0 != main_~p4~0); 9144#L68-1 assume !(0 != main_~p5~0); 8965#L72-1 assume !(0 != main_~p6~0); 8966#L76-1 assume !(0 != main_~p7~0); 9113#L80-1 assume !(0 != main_~p8~0); 9109#L84-1 assume !(0 != main_~p1~0); 9084#L90-1 assume !(0 != main_~p2~0); 9082#L95-1 assume !(0 != main_~p3~0); 9077#L100-1 assume !(0 != main_~p4~0); 9074#L105-1 assume !(0 != main_~p5~0); 9070#L110-1 assume !(0 != main_~p6~0); 9034#L115-1 assume !(0 != main_~p7~0); 9036#L120-1 assume !(0 != main_~p8~0); 8924#L125-1 [2019-01-14 02:55:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-14 02:55:03,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:03,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:03,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash -85133366, now seen corresponding path program 1 times [2019-01-14 02:55:03,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:03,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:55:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:55:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -493957591, now seen corresponding path program 1 times [2019-01-14 02:55:03,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:55:03,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:55:03,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:55:03,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:55:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:55:03,807 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:55:03,954 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:55:04,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:55:04 BoogieIcfgContainer [2019-01-14 02:55:04,068 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:55:04,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:55:04,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:55:04,069 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:55:04,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:55:01" (3/4) ... [2019-01-14 02:55:04,072 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:55:04,129 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:55:04,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:55:04,131 INFO L168 Benchmark]: Toolchain (without parser) took 3598.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 951.3 MB in the beginning and 904.1 MB in the end (delta: 47.3 MB). Peak memory consumption was 143.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:04,132 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:04,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:04,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.69 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:55:04,133 INFO L168 Benchmark]: Boogie Preprocessor took 44.31 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:04,134 INFO L168 Benchmark]: RCFGBuilder took 636.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:04,135 INFO L168 Benchmark]: BuchiAutomizer took 2538.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 911.0 MB in the end (delta: 159.5 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:04,135 INFO L168 Benchmark]: Witness Printer took 61.42 ms. Allocated memory is still 1.1 GB. Free memory was 911.0 MB in the beginning and 904.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:55:04,140 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.69 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.31 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 636.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2538.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 911.0 MB in the end (delta: 159.5 MB). Peak memory consumption was 159.5 MB. Max. memory is 11.5 GB. * Witness Printer took 61.42 ms. Allocated memory is still 1.1 GB. Free memory was 911.0 MB in the beginning and 904.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2881 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2881 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 452 SDtfs, 236 SDslu, 270 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 33]: 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@2e3ab1bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e9924ed=1, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@162858ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@503a0334=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b2f2823=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a817939=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@223c8d10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3127472f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1126052a=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: 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; [L31] int cond; Loop: [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...