./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/locks/test_locks_10_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_10_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 0f7b0b589689413087c164ce10eb80c902ee4046 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:54:31,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:54:31,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:54:31,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:54:31,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:54:31,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:54:31,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:54:31,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:54:31,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:54:31,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:54:31,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:54:31,899 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:54:31,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:54:31,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:54:31,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:54:31,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:54:31,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:54:31,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:54:31,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:54:31,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:54:31,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:54:31,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:54:31,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:54:31,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:54:31,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:54:31,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:54:31,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:54:31,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:54:31,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:54:31,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:54:31,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:54:31,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:54:31,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:54:31,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:54:31,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:54:31,922 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:31,943 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:54:31,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:54:31,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:54:31,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:54:31,945 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:54:31,946 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:54:31,946 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:54:31,946 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:54:31,947 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:54:31,947 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:54:31,947 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:54:31,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:54:31,947 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:54:31,947 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:54:31,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:54:31,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:54:31,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:54:31,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:54:31,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:54:31,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:54:31,950 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:54:31,950 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:54:31,951 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:54:31,951 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:54:31,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:54:31,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:54:31,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:54:31,952 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:54:31,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:54:31,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:54:31,953 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:54:31,955 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:54:31,955 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-01-14 02:54:32,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:54:32,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:54:32,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:54:32,022 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:54:32,022 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:54:32,023 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:32,105 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b3fa3f2/77ddf61dd4784cf4a0b3e4d72ce17841/FLAG83a3254af [2019-01-14 02:54:32,501 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:54:32,502 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:32,511 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b3fa3f2/77ddf61dd4784cf4a0b3e4d72ce17841/FLAG83a3254af [2019-01-14 02:54:32,877 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b3fa3f2/77ddf61dd4784cf4a0b3e4d72ce17841 [2019-01-14 02:54:32,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:54:32,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:54:32,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:54:32,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:54:32,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:54:32,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:54:32" (1/1) ... [2019-01-14 02:54:32,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4667f227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:32, skipping insertion in model container [2019-01-14 02:54:32,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:54:32" (1/1) ... [2019-01-14 02:54:32,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:54:32,926 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:54:33,157 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:54:33,161 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:54:33,188 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:54:33,208 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:54:33,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33 WrapperNode [2019-01-14 02:54:33,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:54:33,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:54:33,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:54:33,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:54:33,220 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:54:33" (1/1) ... [2019-01-14 02:54:33,228 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:54:33" (1/1) ... [2019-01-14 02:54:33,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:54:33,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:54:33,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:54:33,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:54:33,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (1/1) ... [2019-01-14 02:54:33,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (1/1) ... [2019-01-14 02:54:33,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (1/1) ... [2019-01-14 02:54:33,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (1/1) ... [2019-01-14 02:54:33,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (1/1) ... [2019-01-14 02:54:33,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (1/1) ... [2019-01-14 02:54:33,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (1/1) ... [2019-01-14 02:54:33,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:54:33,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:54:33,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:54:33,297 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:54:33,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (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:54:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:54:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:54:33,969 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:54:33,969 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:54:33,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:33 BoogieIcfgContainer [2019-01-14 02:54:33,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:54:33,971 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:54:33,971 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:54:33,975 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:54:33,976 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:33,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:54:32" (1/3) ... [2019-01-14 02:54:33,977 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f9d2244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:54:33, skipping insertion in model container [2019-01-14 02:54:33,978 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:33,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:33" (2/3) ... [2019-01-14 02:54:33,978 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f9d2244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:54:33, skipping insertion in model container [2019-01-14 02:54:33,978 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:33,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:33" (3/3) ... [2019-01-14 02:54:33,980 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:34,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:54:34,041 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:54:34,041 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:54:34,042 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:54:34,042 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:54:34,042 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:54:34,042 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:54:34,042 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:54:34,043 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:54:34,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2019-01-14 02:54:34,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-01-14 02:54:34,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:34,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:34,093 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:34,093 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:34,093 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:54:34,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states. [2019-01-14 02:54:34,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-01-14 02:54:34,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:34,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:34,099 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:34,099 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:34,105 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 17#L153-1true [2019-01-14 02:54:34,106 INFO L796 eck$LassoCheckResult]: Loop: 17#L153-1true assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 26#L41true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 37#L66true assume 0 != main_~p1~0;main_~lk1~0 := 1; 33#L66-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 22#L70-1true assume !(0 != main_~p3~0); 27#L74-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L78-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 6#L82-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 31#L86-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 39#L90-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 25#L94-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 11#L98-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 3#L102-1true assume !(0 != main_~p1~0); 34#L108-1true assume !(0 != main_~p2~0); 4#L113-1true assume !(0 != main_~p3~0); 9#L118-1true assume !(0 != main_~p4~0); 20#L123-1true assume !(0 != main_~p5~0); 30#L128-1true assume !(0 != main_~p6~0); 19#L133-1true assume !(0 != main_~p7~0); 28#L138-1true assume !(0 != main_~p8~0); 38#L143-1true assume !(0 != main_~p9~0); 8#L148-1true assume !(0 != main_~p10~0); 17#L153-1true [2019-01-14 02:54:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:54:34,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1844487545, now seen corresponding path program 1 times [2019-01-14 02:54:34,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:34,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:34,308 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:54:34,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:34,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:34,317 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:34,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:34,340 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-01-14 02:54:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:34,398 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2019-01-14 02:54:34,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:34,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 129 transitions. [2019-01-14 02:54:34,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2019-01-14 02:54:34,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 64 states and 102 transitions. [2019-01-14 02:54:34,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2019-01-14 02:54:34,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-01-14 02:54:34,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 102 transitions. [2019-01-14 02:54:34,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:34,416 INFO L706 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-01-14 02:54:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 102 transitions. [2019-01-14 02:54:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-14 02:54:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 02:54:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 102 transitions. [2019-01-14 02:54:34,453 INFO L729 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-01-14 02:54:34,453 INFO L609 BuchiCegarLoop]: Abstraction has 64 states and 102 transitions. [2019-01-14 02:54:34,453 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:54:34,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 102 transitions. [2019-01-14 02:54:34,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2019-01-14 02:54:34,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:34,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:34,456 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:34,457 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:34,457 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 155#L153-1 [2019-01-14 02:54:34,457 INFO L796 eck$LassoCheckResult]: Loop: 155#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 161#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 160#L66 assume !(0 != main_~p1~0); 156#L66-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 147#L70-1 assume !(0 != main_~p3~0); 148#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 140#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 128#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 129#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 153#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 151#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 136#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 137#L102-1 assume !(0 != main_~p1~0); 159#L108-1 assume !(0 != main_~p2~0); 183#L113-1 assume !(0 != main_~p3~0); 181#L118-1 assume !(0 != main_~p4~0); 146#L123-1 assume !(0 != main_~p5~0); 139#L128-1 assume !(0 != main_~p6~0); 143#L133-1 assume !(0 != main_~p7~0); 145#L138-1 assume !(0 != main_~p8~0); 127#L143-1 assume !(0 != main_~p9~0); 163#L148-1 assume !(0 != main_~p10~0); 155#L153-1 [2019-01-14 02:54:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,457 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:54:34,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1026839095, now seen corresponding path program 1 times [2019-01-14 02:54:34,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:34,531 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:54:34,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:34,532 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:34,533 INFO L87 Difference]: Start difference. First operand 64 states and 102 transitions. cyclomatic complexity: 40 Second operand 3 states. [2019-01-14 02:54:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:34,586 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2019-01-14 02:54:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:34,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 197 transitions. [2019-01-14 02:54:34,592 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2019-01-14 02:54:34,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 197 transitions. [2019-01-14 02:54:34,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-01-14 02:54:34,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-01-14 02:54:34,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 197 transitions. [2019-01-14 02:54:34,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:34,597 INFO L706 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-01-14 02:54:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 197 transitions. [2019-01-14 02:54:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-14 02:54:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 02:54:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 197 transitions. [2019-01-14 02:54:34,611 INFO L729 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-01-14 02:54:34,611 INFO L609 BuchiCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-01-14 02:54:34,611 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:54:34,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 197 transitions. [2019-01-14 02:54:34,614 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2019-01-14 02:54:34,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:34,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:34,615 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:34,615 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:34,615 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 352#L153-1 [2019-01-14 02:54:34,616 INFO L796 eck$LassoCheckResult]: Loop: 352#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 371#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 370#L66 assume !(0 != main_~p1~0); 369#L66-2 assume !(0 != main_~p2~0); 366#L70-1 assume !(0 != main_~p3~0); 365#L74-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 364#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 363#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 362#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 361#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 360#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 358#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 359#L102-1 assume !(0 != main_~p1~0); 388#L108-1 assume !(0 != main_~p2~0); 387#L113-1 assume !(0 != main_~p3~0); 385#L118-1 assume !(0 != main_~p4~0); 382#L123-1 assume !(0 != main_~p5~0); 381#L128-1 assume !(0 != main_~p6~0); 379#L133-1 assume !(0 != main_~p7~0); 377#L138-1 assume !(0 != main_~p8~0); 375#L143-1 assume !(0 != main_~p9~0); 373#L148-1 assume !(0 != main_~p10~0); 352#L153-1 [2019-01-14 02:54:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,616 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:54:34,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash -662104647, now seen corresponding path program 1 times [2019-01-14 02:54:34,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:34,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:34,712 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:54:34,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:34,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:34,713 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:34,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:34,715 INFO L87 Difference]: Start difference. First operand 125 states and 197 transitions. cyclomatic complexity: 76 Second operand 3 states. [2019-01-14 02:54:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:34,816 INFO L93 Difference]: Finished difference Result 245 states and 381 transitions. [2019-01-14 02:54:34,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:34,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 381 transitions. [2019-01-14 02:54:34,822 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2019-01-14 02:54:34,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 381 transitions. [2019-01-14 02:54:34,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2019-01-14 02:54:34,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2019-01-14 02:54:34,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 381 transitions. [2019-01-14 02:54:34,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:34,829 INFO L706 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-01-14 02:54:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 381 transitions. [2019-01-14 02:54:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-01-14 02:54:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-14 02:54:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2019-01-14 02:54:34,854 INFO L729 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-01-14 02:54:34,854 INFO L609 BuchiCegarLoop]: Abstraction has 245 states and 381 transitions. [2019-01-14 02:54:34,854 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:54:34,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 381 transitions. [2019-01-14 02:54:34,857 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2019-01-14 02:54:34,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:34,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:34,858 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:34,858 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:34,860 INFO L794 eck$LassoCheckResult]: Stem: 727#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 728#L153-1 [2019-01-14 02:54:34,861 INFO L796 eck$LassoCheckResult]: Loop: 728#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 765#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 760#L66 assume !(0 != main_~p1~0); 753#L66-2 assume !(0 != main_~p2~0); 754#L70-1 assume !(0 != main_~p3~0); 854#L74-1 assume !(0 != main_~p4~0); 853#L78-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 851#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 849#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 847#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 845#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 843#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 838#L102-1 assume !(0 != main_~p1~0); 834#L108-1 assume !(0 != main_~p2~0); 831#L113-1 assume !(0 != main_~p3~0); 822#L118-1 assume !(0 != main_~p4~0); 819#L123-1 assume !(0 != main_~p5~0); 816#L128-1 assume !(0 != main_~p6~0); 812#L133-1 assume !(0 != main_~p7~0); 808#L138-1 assume !(0 != main_~p8~0); 804#L143-1 assume !(0 != main_~p9~0); 800#L148-1 assume !(0 != main_~p10~0); 728#L153-1 [2019-01-14 02:54:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-14 02:54:34,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2044514747, now seen corresponding path program 1 times [2019-01-14 02:54:34,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:34,943 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:54:34,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:34,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:34,945 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:34,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:34,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:34,946 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. cyclomatic complexity: 144 Second operand 3 states. [2019-01-14 02:54:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:35,015 INFO L93 Difference]: Finished difference Result 481 states and 737 transitions. [2019-01-14 02:54:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:35,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 737 transitions. [2019-01-14 02:54:35,027 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2019-01-14 02:54:35,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 481 states and 737 transitions. [2019-01-14 02:54:35,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2019-01-14 02:54:35,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 481 [2019-01-14 02:54:35,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 737 transitions. [2019-01-14 02:54:35,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:35,050 INFO L706 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-01-14 02:54:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 737 transitions. [2019-01-14 02:54:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-01-14 02:54:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 02:54:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 737 transitions. [2019-01-14 02:54:35,097 INFO L729 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-01-14 02:54:35,097 INFO L609 BuchiCegarLoop]: Abstraction has 481 states and 737 transitions. [2019-01-14 02:54:35,097 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:54:35,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 737 transitions. [2019-01-14 02:54:35,103 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2019-01-14 02:54:35,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:35,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:35,104 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:35,104 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:35,105 INFO L794 eck$LassoCheckResult]: Stem: 1461#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 1462#L153-1 [2019-01-14 02:54:35,106 INFO L796 eck$LassoCheckResult]: Loop: 1462#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 1635#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 1631#L66 assume !(0 != main_~p1~0); 1577#L66-2 assume !(0 != main_~p2~0); 1491#L70-1 assume !(0 != main_~p3~0); 1492#L74-1 assume !(0 != main_~p4~0); 1566#L78-1 assume !(0 != main_~p5~0); 1567#L82-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1560#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1561#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1554#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1555#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1546#L102-1 assume !(0 != main_~p1~0); 1547#L108-1 assume !(0 != main_~p2~0); 1537#L113-1 assume !(0 != main_~p3~0); 1536#L118-1 assume !(0 != main_~p4~0); 1609#L123-1 assume !(0 != main_~p5~0); 1683#L128-1 assume !(0 != main_~p6~0); 1680#L133-1 assume !(0 != main_~p7~0); 1677#L138-1 assume !(0 != main_~p8~0); 1673#L143-1 assume !(0 != main_~p9~0); 1647#L148-1 assume !(0 != main_~p10~0); 1462#L153-1 [2019-01-14 02:54:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-14 02:54:35,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1023446393, now seen corresponding path program 1 times [2019-01-14 02:54:35,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:35,178 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:54:35,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:35,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:35,179 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:35,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:35,180 INFO L87 Difference]: Start difference. First operand 481 states and 737 transitions. cyclomatic complexity: 272 Second operand 3 states. [2019-01-14 02:54:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:35,227 INFO L93 Difference]: Finished difference Result 945 states and 1425 transitions. [2019-01-14 02:54:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:35,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 945 states and 1425 transitions. [2019-01-14 02:54:35,237 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2019-01-14 02:54:35,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 945 states to 945 states and 1425 transitions. [2019-01-14 02:54:35,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 945 [2019-01-14 02:54:35,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 945 [2019-01-14 02:54:35,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 945 states and 1425 transitions. [2019-01-14 02:54:35,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:35,250 INFO L706 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-01-14 02:54:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states and 1425 transitions. [2019-01-14 02:54:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-01-14 02:54:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-14 02:54:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1425 transitions. [2019-01-14 02:54:35,276 INFO L729 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-01-14 02:54:35,276 INFO L609 BuchiCegarLoop]: Abstraction has 945 states and 1425 transitions. [2019-01-14 02:54:35,276 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:54:35,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 945 states and 1425 transitions. [2019-01-14 02:54:35,284 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2019-01-14 02:54:35,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:35,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:35,285 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:35,285 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:35,285 INFO L794 eck$LassoCheckResult]: Stem: 2900#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 2901#L153-1 [2019-01-14 02:54:35,286 INFO L796 eck$LassoCheckResult]: Loop: 2901#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 3094#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 3092#L66 assume !(0 != main_~p1~0); 3090#L66-2 assume !(0 != main_~p2~0); 3089#L70-1 assume !(0 != main_~p3~0); 3087#L74-1 assume !(0 != main_~p4~0); 3085#L78-1 assume !(0 != main_~p5~0); 3082#L82-1 assume !(0 != main_~p6~0); 3073#L86-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3074#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3059#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3060#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3043#L102-1 assume !(0 != main_~p1~0); 3044#L108-1 assume !(0 != main_~p2~0); 3026#L113-1 assume !(0 != main_~p3~0); 3025#L118-1 assume !(0 != main_~p4~0); 3003#L123-1 assume !(0 != main_~p5~0); 3004#L128-1 assume !(0 != main_~p6~0); 3102#L133-1 assume !(0 != main_~p7~0); 3100#L138-1 assume !(0 != main_~p8~0); 3098#L143-1 assume !(0 != main_~p9~0); 3096#L148-1 assume !(0 != main_~p10~0); 2901#L153-1 [2019-01-14 02:54:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-14 02:54:35,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:35,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash -256417285, now seen corresponding path program 1 times [2019-01-14 02:54:35,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:35,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:35,335 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:54:35,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:35,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:35,336 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:35,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:35,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:35,337 INFO L87 Difference]: Start difference. First operand 945 states and 1425 transitions. cyclomatic complexity: 512 Second operand 3 states. [2019-01-14 02:54:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:35,427 INFO L93 Difference]: Finished difference Result 1857 states and 2753 transitions. [2019-01-14 02:54:35,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:35,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1857 states and 2753 transitions. [2019-01-14 02:54:35,454 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2019-01-14 02:54:35,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1857 states to 1857 states and 2753 transitions. [2019-01-14 02:54:35,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1857 [2019-01-14 02:54:35,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1857 [2019-01-14 02:54:35,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1857 states and 2753 transitions. [2019-01-14 02:54:35,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:35,480 INFO L706 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-01-14 02:54:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states and 2753 transitions. [2019-01-14 02:54:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2019-01-14 02:54:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2019-01-14 02:54:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2753 transitions. [2019-01-14 02:54:35,530 INFO L729 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-01-14 02:54:35,530 INFO L609 BuchiCegarLoop]: Abstraction has 1857 states and 2753 transitions. [2019-01-14 02:54:35,530 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:54:35,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1857 states and 2753 transitions. [2019-01-14 02:54:35,543 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2019-01-14 02:54:35,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:35,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:35,544 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:35,544 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:35,544 INFO L794 eck$LassoCheckResult]: Stem: 5707#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 5708#L153-1 [2019-01-14 02:54:35,545 INFO L796 eck$LassoCheckResult]: Loop: 5708#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 5792#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 5789#L66 assume !(0 != main_~p1~0); 5787#L66-2 assume !(0 != main_~p2~0); 5784#L70-1 assume !(0 != main_~p3~0); 5780#L74-1 assume !(0 != main_~p4~0); 5776#L78-1 assume !(0 != main_~p5~0); 5772#L82-1 assume !(0 != main_~p6~0); 5769#L86-1 assume !(0 != main_~p7~0); 5767#L90-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 5765#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 5762#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 5759#L102-1 assume !(0 != main_~p1~0); 5756#L108-1 assume !(0 != main_~p2~0); 5752#L113-1 assume !(0 != main_~p3~0); 5751#L118-1 assume !(0 != main_~p4~0); 5815#L123-1 assume !(0 != main_~p5~0); 5811#L128-1 assume !(0 != main_~p6~0); 5807#L133-1 assume !(0 != main_~p7~0); 5804#L138-1 assume !(0 != main_~p8~0); 5800#L143-1 assume !(0 != main_~p9~0); 5797#L148-1 assume !(0 != main_~p10~0); 5708#L153-1 [2019-01-14 02:54:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-14 02:54:35,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:35,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1267534535, now seen corresponding path program 1 times [2019-01-14 02:54:35,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:35,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:35,621 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:54:35,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:35,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:35,622 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:35,623 INFO L87 Difference]: Start difference. First operand 1857 states and 2753 transitions. cyclomatic complexity: 960 Second operand 3 states. [2019-01-14 02:54:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:35,729 INFO L93 Difference]: Finished difference Result 3649 states and 5313 transitions. [2019-01-14 02:54:35,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:35,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3649 states and 5313 transitions. [2019-01-14 02:54:35,774 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2019-01-14 02:54:35,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3649 states to 3649 states and 5313 transitions. [2019-01-14 02:54:35,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3649 [2019-01-14 02:54:35,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3649 [2019-01-14 02:54:35,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3649 states and 5313 transitions. [2019-01-14 02:54:35,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:35,823 INFO L706 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-01-14 02:54:35,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states and 5313 transitions. [2019-01-14 02:54:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3649. [2019-01-14 02:54:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2019-01-14 02:54:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5313 transitions. [2019-01-14 02:54:35,920 INFO L729 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-01-14 02:54:35,920 INFO L609 BuchiCegarLoop]: Abstraction has 3649 states and 5313 transitions. [2019-01-14 02:54:35,920 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:54:35,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3649 states and 5313 transitions. [2019-01-14 02:54:35,950 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2019-01-14 02:54:35,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:35,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:35,952 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:35,953 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:35,954 INFO L794 eck$LassoCheckResult]: Stem: 11215#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 11216#L153-1 [2019-01-14 02:54:35,954 INFO L796 eck$LassoCheckResult]: Loop: 11216#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 11415#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 11362#L66 assume !(0 != main_~p1~0); 11364#L66-2 assume !(0 != main_~p2~0); 11381#L70-1 assume !(0 != main_~p3~0); 11382#L74-1 assume !(0 != main_~p4~0); 11490#L78-1 assume !(0 != main_~p5~0); 11483#L82-1 assume !(0 != main_~p6~0); 11485#L86-1 assume !(0 != main_~p7~0); 11476#L90-1 assume !(0 != main_~p8~0); 11478#L94-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 11470#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 11471#L102-1 assume !(0 != main_~p1~0); 11519#L108-1 assume !(0 != main_~p2~0); 11517#L113-1 assume !(0 != main_~p3~0); 11512#L118-1 assume !(0 != main_~p4~0); 11513#L123-1 assume !(0 != main_~p5~0); 11532#L128-1 assume !(0 != main_~p6~0); 11530#L133-1 assume !(0 != main_~p7~0); 11529#L138-1 assume !(0 != main_~p8~0); 11426#L143-1 assume !(0 != main_~p9~0); 11425#L148-1 assume !(0 != main_~p10~0); 11216#L153-1 [2019-01-14 02:54:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-14 02:54:35,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1854340549, now seen corresponding path program 1 times [2019-01-14 02:54:35,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:35,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:35,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:36,022 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:54:36,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:36,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:36,023 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:36,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:36,024 INFO L87 Difference]: Start difference. First operand 3649 states and 5313 transitions. cyclomatic complexity: 1792 Second operand 3 states. [2019-01-14 02:54:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:36,111 INFO L93 Difference]: Finished difference Result 7169 states and 10241 transitions. [2019-01-14 02:54:36,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:36,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7169 states and 10241 transitions. [2019-01-14 02:54:36,164 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2019-01-14 02:54:36,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7169 states to 7169 states and 10241 transitions. [2019-01-14 02:54:36,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7169 [2019-01-14 02:54:36,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7169 [2019-01-14 02:54:36,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7169 states and 10241 transitions. [2019-01-14 02:54:36,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:36,239 INFO L706 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-01-14 02:54:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states and 10241 transitions. [2019-01-14 02:54:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7169. [2019-01-14 02:54:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7169 states. [2019-01-14 02:54:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 10241 transitions. [2019-01-14 02:54:36,416 INFO L729 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-01-14 02:54:36,416 INFO L609 BuchiCegarLoop]: Abstraction has 7169 states and 10241 transitions. [2019-01-14 02:54:36,416 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:54:36,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7169 states and 10241 transitions. [2019-01-14 02:54:36,445 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2019-01-14 02:54:36,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:36,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:36,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:36,446 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:36,446 INFO L794 eck$LassoCheckResult]: Stem: 22045#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 22046#L153-1 [2019-01-14 02:54:36,446 INFO L796 eck$LassoCheckResult]: Loop: 22046#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 22320#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 22315#L66 assume !(0 != main_~p1~0); 22316#L66-2 assume !(0 != main_~p2~0); 22303#L70-1 assume !(0 != main_~p3~0); 22304#L74-1 assume !(0 != main_~p4~0); 22412#L78-1 assume !(0 != main_~p5~0); 22408#L82-1 assume !(0 != main_~p6~0); 22404#L86-1 assume !(0 != main_~p7~0); 22398#L90-1 assume !(0 != main_~p8~0); 22392#L94-1 assume !(0 != main_~p9~0); 22389#L98-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 22384#L102-1 assume !(0 != main_~p1~0); 22378#L108-1 assume !(0 != main_~p2~0); 22373#L113-1 assume !(0 != main_~p3~0); 22365#L118-1 assume !(0 != main_~p4~0); 22361#L123-1 assume !(0 != main_~p5~0); 22358#L128-1 assume !(0 != main_~p6~0); 22354#L133-1 assume !(0 != main_~p7~0); 22348#L138-1 assume !(0 != main_~p8~0); 22342#L143-1 assume !(0 != main_~p9~0); 22331#L148-1 assume !(0 != main_~p10~0); 22046#L153-1 [2019-01-14 02:54:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-14 02:54:36,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:36,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:36,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:36,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:36,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:36,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1596175111, now seen corresponding path program 1 times [2019-01-14 02:54:36,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:36,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:36,517 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:54:36,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:36,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:54:36,518 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:36,519 INFO L87 Difference]: Start difference. First operand 7169 states and 10241 transitions. cyclomatic complexity: 3328 Second operand 3 states. [2019-01-14 02:54:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:36,653 INFO L93 Difference]: Finished difference Result 14081 states and 19713 transitions. [2019-01-14 02:54:36,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:36,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14081 states and 19713 transitions. [2019-01-14 02:54:36,730 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2019-01-14 02:54:36,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14081 states to 14081 states and 19713 transitions. [2019-01-14 02:54:36,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14081 [2019-01-14 02:54:36,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14081 [2019-01-14 02:54:36,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14081 states and 19713 transitions. [2019-01-14 02:54:36,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:36,951 INFO L706 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-01-14 02:54:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states and 19713 transitions. [2019-01-14 02:54:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 14081. [2019-01-14 02:54:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14081 states. [2019-01-14 02:54:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14081 states to 14081 states and 19713 transitions. [2019-01-14 02:54:37,199 INFO L729 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-01-14 02:54:37,200 INFO L609 BuchiCegarLoop]: Abstraction has 14081 states and 19713 transitions. [2019-01-14 02:54:37,200 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:54:37,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14081 states and 19713 transitions. [2019-01-14 02:54:37,260 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2019-01-14 02:54:37,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:37,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:37,261 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:37,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, 1, 1, 1, 1] [2019-01-14 02:54:37,261 INFO L794 eck$LassoCheckResult]: Stem: 43300#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;havoc main_~cond~0; 43301#L153-1 [2019-01-14 02:54:37,261 INFO L796 eck$LassoCheckResult]: Loop: 43301#L153-1 assume !false;main_~cond~0 := main_#t~nondet10;havoc main_#t~nondet10; 43624#L41 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0; 43621#L66 assume !(0 != main_~p1~0); 43617#L66-2 assume !(0 != main_~p2~0); 43614#L70-1 assume !(0 != main_~p3~0); 43611#L74-1 assume !(0 != main_~p4~0); 43607#L78-1 assume !(0 != main_~p5~0); 43604#L82-1 assume !(0 != main_~p6~0); 43600#L86-1 assume !(0 != main_~p7~0); 43601#L90-1 assume !(0 != main_~p8~0); 43649#L94-1 assume !(0 != main_~p9~0); 43748#L98-1 assume !(0 != main_~p10~0); 43750#L102-1 assume !(0 != main_~p1~0); 43657#L108-1 assume !(0 != main_~p2~0); 43654#L113-1 assume !(0 != main_~p3~0); 43650#L118-1 assume !(0 != main_~p4~0); 43645#L123-1 assume !(0 != main_~p5~0); 43460#L128-1 assume !(0 != main_~p6~0); 43462#L133-1 assume !(0 != main_~p7~0); 43634#L138-1 assume !(0 != main_~p8~0); 43630#L143-1 assume !(0 != main_~p9~0); 43627#L148-1 assume !(0 != main_~p10~0); 43301#L153-1 [2019-01-14 02:54:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-01-14 02:54:37,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:37,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:37,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:37,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:37,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:37,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash -895110533, now seen corresponding path program 1 times [2019-01-14 02:54:37,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:37,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:37,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:37,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:37,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash -962117286, now seen corresponding path program 1 times [2019-01-14 02:54:37,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:37,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:37,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:37,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:37,750 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:54:37,871 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:54:38,067 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 02:54:38,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:54:38 BoogieIcfgContainer [2019-01-14 02:54:38,151 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:54:38,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:54:38,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:54:38,153 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:54:38,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:33" (3/4) ... [2019-01-14 02:54:38,160 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:54:38,269 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:54:38,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:54:38,270 INFO L168 Benchmark]: Toolchain (without parser) took 5388.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:38,275 INFO L168 Benchmark]: CDTParser took 0.15 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:54:38,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.27 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:38,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.90 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 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:54:38,276 INFO L168 Benchmark]: Boogie Preprocessor took 39.05 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:54:38,277 INFO L168 Benchmark]: RCFGBuilder took 673.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:38,277 INFO L168 Benchmark]: BuchiAutomizer took 4180.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.4 MB). Peak memory consumption was 133.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:38,282 INFO L168 Benchmark]: Witness Printer took 116.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:38,294 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.27 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 47.90 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.05 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 673.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4180.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.4 MB). Peak memory consumption was 133.3 MB. Max. memory is 11.5 GB. * Witness Printer took 116.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14081 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.5s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 14081 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 713 SDtfs, 374 SDslu, 436 SDs, 0 SdLazy, 45 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI9 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: 39]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d50e739=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55ef0909=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d52352=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54157179=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48a61c36=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58ed65d5=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64f6b3bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52b1caaf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@672f7015=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f6e6255=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c515418=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: 39]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L37] int cond; Loop: [L39] COND TRUE 1 [L40] cond = __VERIFIER_nondet_int() [L41] COND FALSE !(cond == 0) [L44] lk1 = 0 [L46] lk2 = 0 [L48] lk3 = 0 [L50] lk4 = 0 [L52] lk5 = 0 [L54] lk6 = 0 [L56] lk7 = 0 [L58] lk8 = 0 [L60] lk9 = 0 [L62] lk10 = 0 [L66] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L74] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L82] COND FALSE !(p5 != 0) [L86] COND FALSE !(p6 != 0) [L90] COND FALSE !(p7 != 0) [L94] COND FALSE !(p8 != 0) [L98] COND FALSE !(p9 != 0) [L102] COND FALSE !(p10 != 0) [L108] COND FALSE !(p1 != 0) [L113] COND FALSE !(p2 != 0) [L118] COND FALSE !(p3 != 0) [L123] COND FALSE !(p4 != 0) [L128] COND FALSE !(p5 != 0) [L133] COND FALSE !(p6 != 0) [L138] COND FALSE !(p7 != 0) [L143] COND FALSE !(p8 != 0) [L148] COND FALSE !(p9 != 0) [L153] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...