./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/systemc/toy2.cil.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 c8989412e094655bcf4508d76eb9764ed06d0b34 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-28 03:45:59,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:45:59,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:45:59,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:45:59,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:45:59,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:45:59,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:45:59,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:45:59,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:45:59,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:45:59,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:45:59,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:45:59,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:45:59,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:45:59,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:45:59,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:45:59,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:45:59,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:45:59,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:45:59,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:45:59,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:45:59,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:45:59,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:45:59,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:45:59,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:45:59,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:45:59,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:45:59,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:45:59,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:45:59,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:45:59,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:45:59,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:45:59,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:45:59,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:45:59,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:45:59,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:45:59,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:45:59,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:45:59,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:45:59,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:45:59,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:45:59,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:45:59,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:45:59,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:45:59,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:45:59,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:45:59,202 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:45:59,203 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:45:59,203 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:45:59,203 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:45:59,204 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:45:59,204 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:45:59,204 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:45:59,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:45:59,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:45:59,205 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:45:59,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:45:59,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:45:59,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:45:59,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:45:59,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:45:59,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:45:59,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:45:59,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:45:59,208 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:45:59,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:45:59,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:45:59,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:45:59,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:45:59,209 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:45:59,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:45:59,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:45:59,210 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:45:59,211 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:45:59,212 INFO L138 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 -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2019-11-28 03:45:59,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:45:59,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:45:59,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:45:59,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:45:59,553 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:45:59,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2019-11-28 03:45:59,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd73c5c72/7391bc1f1f6f4eadb87f79e88e0e2a89/FLAGb2e55cd70 [2019-11-28 03:46:00,173 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:46:00,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2019-11-28 03:46:00,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd73c5c72/7391bc1f1f6f4eadb87f79e88e0e2a89/FLAGb2e55cd70 [2019-11-28 03:46:00,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd73c5c72/7391bc1f1f6f4eadb87f79e88e0e2a89 [2019-11-28 03:46:00,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:46:00,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:46:00,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:46:00,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:46:00,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:46:00,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:00,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ec0670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00, skipping insertion in model container [2019-11-28 03:46:00,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:00,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:46:00,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:46:00,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:46:00,820 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:46:00,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:46:00,962 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:46:00,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00 WrapperNode [2019-11-28 03:46:00,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:46:00,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:46:00,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:46:00,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:46:00,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:00,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:46:01,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:46:01,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:46:01,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:46:01,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... [2019-11-28 03:46:01,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:46:01,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:46:01,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:46:01,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:46:01,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:46:01,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:46:01,842 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:46:01,843 INFO L297 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-28 03:46:01,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:46:01 BoogieIcfgContainer [2019-11-28 03:46:01,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:46:01,845 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:46:01,846 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:46:01,851 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:46:01,852 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:46:01,852 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:46:00" (1/3) ... [2019-11-28 03:46:01,853 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aa4fdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:46:01, skipping insertion in model container [2019-11-28 03:46:01,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:46:01,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:46:00" (2/3) ... [2019-11-28 03:46:01,854 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aa4fdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:46:01, skipping insertion in model container [2019-11-28 03:46:01,854 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:46:01,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:46:01" (3/3) ... [2019-11-28 03:46:01,856 INFO L371 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2019-11-28 03:46:01,907 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:46:01,908 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:46:01,908 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:46:01,908 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:46:01,909 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:46:01,910 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:46:01,910 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:46:01,910 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:46:01,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states. [2019-11-28 03:46:01,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:01,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:01,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:02,003 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,003 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,004 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:46:02,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states. [2019-11-28 03:46:02,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:02,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:02,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:02,013 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,013 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,021 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRYtrue ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 10#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 74#L394true assume !(1 == ~c_req_up~0); 63#L394-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 61#L405-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 88#L410-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 109#L415-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 4#L420-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 27#L425-1true assume !(0 == ~e_f~0); 54#L430-1true assume !(0 == ~e_g~0); 79#L435-1true assume !(0 == ~e_e~0); 101#L440-1true assume !(0 == ~e_c~0); 122#L445-1true assume !(0 == ~e_wl~0); 21#L450-1true assume !(1 == ~wl_pc~0); 100#L462true assume !(2 == ~wl_pc~0); 67#L463true assume !(1 == ~c1_pc~0); 98#L473true assume !(1 == ~c2_pc~0); 70#L482true assume !(1 == ~wb_pc~0); 42#L491true assume !(1 == ~e_c~0); 120#L500-1true assume !(1 == ~e_e~0); 17#L505-1true assume !(1 == ~e_f~0); 47#L510-1true assume !(1 == ~e_g~0); 71#L515-1true assume !(1 == ~e_c~0); 96#L520-1true assume !(1 == ~e_wl~0); 24#L662-1true [2019-11-28 03:46:02,021 INFO L796 eck$LassoCheckResult]: Loop: 24#L662-1true assume !false; 45#L532true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 51#L367true assume !true; 75#L383true start_simulation_~kernel_st~0 := 2; 35#L538true assume !(1 == ~c_req_up~0); 18#L538-2true start_simulation_~kernel_st~0 := 3; 113#L550true assume !(0 == ~e_f~0); 97#L550-2true assume 0 == ~e_g~0;~e_g~0 := 1; 8#L555-1true assume 0 == ~e_e~0;~e_e~0 := 1; 36#L560-1true assume 0 == ~e_c~0;~e_c~0 := 1; 46#L565-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 68#L570-1true assume !(1 == ~wl_pc~0); 34#L582true assume !(2 == ~wl_pc~0); 112#L583true assume !(1 == ~c1_pc~0); 32#L593true assume !(1 == ~c2_pc~0); 125#L602true assume !(1 == ~wb_pc~0); 90#L611true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L620-1true assume !(1 == ~e_e~0); 85#L625-1true assume 1 == ~e_f~0;~e_f~0 := 2; 107#L630-1true assume 1 == ~e_g~0;~e_g~0 := 2; 126#L635-1true assume 1 == ~e_c~0;~e_c~0 := 2; 25#L640-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 40#L645-1true assume 0 == ~wl_st~0; 24#L662-1true [2019-11-28 03:46:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-11-28 03:46:02,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297408227] [2019-11-28 03:46:02,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297408227] [2019-11-28 03:46:02,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336925176] [2019-11-28 03:46:02,217 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash 25607920, now seen corresponding path program 1 times [2019-11-28 03:46:02,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335981533] [2019-11-28 03:46:02,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335981533] [2019-11-28 03:46:02,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:02,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774089932] [2019-11-28 03:46:02,233 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:02,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:46:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:46:02,253 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-11-28 03:46:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:02,273 INFO L93 Difference]: Finished difference Result 124 states and 217 transitions. [2019-11-28 03:46:02,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:46:02,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 217 transitions. [2019-11-28 03:46:02,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 212 transitions. [2019-11-28 03:46:02,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-11-28 03:46:02,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-11-28 03:46:02,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 212 transitions. [2019-11-28 03:46:02,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:02,291 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-11-28 03:46:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 212 transitions. [2019-11-28 03:46:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-28 03:46:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 03:46:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2019-11-28 03:46:02,332 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-11-28 03:46:02,332 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2019-11-28 03:46:02,332 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:46:02,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 212 transitions. [2019-11-28 03:46:02,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:02,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:02,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,345 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 275#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 276#L394 assume !(1 == ~c_req_up~0); 278#L394-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 351#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 352#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 366#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 260#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 261#L425-1 assume !(0 == ~e_f~0); 307#L430-1 assume !(0 == ~e_g~0); 344#L435-1 assume !(0 == ~e_e~0); 362#L440-1 assume !(0 == ~e_c~0); 372#L445-1 assume !(0 == ~e_wl~0); 297#L450-1 assume !(1 == ~wl_pc~0); 298#L462 assume !(2 == ~wl_pc~0); 284#L463 assume !(1 == ~c1_pc~0); 356#L473 assume !(1 == ~c2_pc~0); 289#L482 assume !(1 == ~wb_pc~0); 332#L491 assume !(1 == ~e_c~0); 333#L500-1 assume !(1 == ~e_e~0); 290#L505-1 assume !(1 == ~e_f~0); 291#L510-1 assume !(1 == ~e_g~0); 337#L515-1 assume !(1 == ~e_c~0); 358#L520-1 assume !(1 == ~e_wl~0); 301#L662-1 [2019-11-28 03:46:02,345 INFO L796 eck$LassoCheckResult]: Loop: 301#L662-1 assume !false; 303#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 335#L367 assume !false; 265#L285 assume !(0 == ~wl_st~0); 267#L289 assume !(0 == ~c1_st~0); 365#L292 assume !(0 == ~c2_st~0); 345#L295 assume !(0 == ~wb_st~0); 346#L298 assume !(0 == ~r_st~0); 353#L383 start_simulation_~kernel_st~0 := 2; 322#L538 assume !(1 == ~c_req_up~0); 294#L538-2 start_simulation_~kernel_st~0 := 3; 295#L550 assume !(0 == ~e_f~0); 370#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 271#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 272#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 325#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 336#L570-1 assume 1 == ~wl_pc~0; 350#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 320#L583 assume !(1 == ~c1_pc~0); 315#L593 assume !(1 == ~c2_pc~0); 317#L602 assume !(1 == ~wb_pc~0); 328#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 348#L620-1 assume !(1 == ~e_e~0); 349#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 364#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 374#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 304#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 305#L645-1 assume 0 == ~wl_st~0; 301#L662-1 [2019-11-28 03:46:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-11-28 03:46:02,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875296724] [2019-11-28 03:46:02,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875296724] [2019-11-28 03:46:02,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361803940] [2019-11-28 03:46:02,410 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 1 times [2019-11-28 03:46:02,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277515129] [2019-11-28 03:46:02,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277515129] [2019-11-28 03:46:02,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548344330] [2019-11-28 03:46:02,451 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:02,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:02,452 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-11-28 03:46:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:02,495 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2019-11-28 03:46:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:02,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 211 transitions. [2019-11-28 03:46:02,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 211 transitions. [2019-11-28 03:46:02,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-11-28 03:46:02,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-11-28 03:46:02,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 211 transitions. [2019-11-28 03:46:02,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:02,512 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-11-28 03:46:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 211 transitions. [2019-11-28 03:46:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-28 03:46:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 03:46:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 211 transitions. [2019-11-28 03:46:02,526 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-11-28 03:46:02,526 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2019-11-28 03:46:02,526 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:46:02,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 211 transitions. [2019-11-28 03:46:02,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:02,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:02,534 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,535 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,535 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 520#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 521#L394 assume !(1 == ~c_req_up~0); 523#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 596#L405-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 597#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 611#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 505#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 506#L425-1 assume !(0 == ~e_f~0); 552#L430-1 assume !(0 == ~e_g~0); 589#L435-1 assume !(0 == ~e_e~0); 607#L440-1 assume !(0 == ~e_c~0); 617#L445-1 assume !(0 == ~e_wl~0); 542#L450-1 assume !(1 == ~wl_pc~0); 543#L462 assume !(2 == ~wl_pc~0); 529#L463 assume !(1 == ~c1_pc~0); 601#L473 assume !(1 == ~c2_pc~0); 534#L482 assume !(1 == ~wb_pc~0); 577#L491 assume !(1 == ~e_c~0); 578#L500-1 assume !(1 == ~e_e~0); 535#L505-1 assume !(1 == ~e_f~0); 536#L510-1 assume !(1 == ~e_g~0); 582#L515-1 assume !(1 == ~e_c~0); 603#L520-1 assume !(1 == ~e_wl~0); 546#L662-1 [2019-11-28 03:46:02,535 INFO L796 eck$LassoCheckResult]: Loop: 546#L662-1 assume !false; 548#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 580#L367 assume !false; 510#L285 assume !(0 == ~wl_st~0); 512#L289 assume !(0 == ~c1_st~0); 610#L292 assume !(0 == ~c2_st~0); 590#L295 assume !(0 == ~wb_st~0); 591#L298 assume !(0 == ~r_st~0); 598#L383 start_simulation_~kernel_st~0 := 2; 567#L538 assume !(1 == ~c_req_up~0); 539#L538-2 start_simulation_~kernel_st~0 := 3; 540#L550 assume !(0 == ~e_f~0); 615#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 516#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 517#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 570#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 581#L570-1 assume 1 == ~wl_pc~0; 595#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 565#L583 assume !(1 == ~c1_pc~0); 560#L593 assume !(1 == ~c2_pc~0); 562#L602 assume !(1 == ~wb_pc~0); 573#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 593#L620-1 assume !(1 == ~e_e~0); 594#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 609#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 619#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 549#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 550#L645-1 assume 0 == ~wl_st~0; 546#L662-1 [2019-11-28 03:46:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-11-28 03:46:02,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142039576] [2019-11-28 03:46:02,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142039576] [2019-11-28 03:46:02,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992467741] [2019-11-28 03:46:02,584 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 2 times [2019-11-28 03:46:02,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584362585] [2019-11-28 03:46:02,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584362585] [2019-11-28 03:46:02,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400181999] [2019-11-28 03:46:02,616 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:02,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:02,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:02,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:02,617 INFO L87 Difference]: Start difference. First operand 119 states and 211 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-11-28 03:46:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:02,637 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2019-11-28 03:46:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:02,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 210 transitions. [2019-11-28 03:46:02,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 210 transitions. [2019-11-28 03:46:02,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-11-28 03:46:02,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-11-28 03:46:02,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 210 transitions. [2019-11-28 03:46:02,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:02,644 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-11-28 03:46:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 210 transitions. [2019-11-28 03:46:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-28 03:46:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 03:46:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 210 transitions. [2019-11-28 03:46:02,652 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-11-28 03:46:02,653 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2019-11-28 03:46:02,653 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:46:02,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 210 transitions. [2019-11-28 03:46:02,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:02,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:02,656 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,656 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,656 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 765#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 766#L394 assume !(1 == ~c_req_up~0); 768#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 841#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 842#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 856#L415-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 750#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 751#L425-1 assume !(0 == ~e_f~0); 797#L430-1 assume !(0 == ~e_g~0); 834#L435-1 assume !(0 == ~e_e~0); 852#L440-1 assume !(0 == ~e_c~0); 862#L445-1 assume !(0 == ~e_wl~0); 787#L450-1 assume !(1 == ~wl_pc~0); 788#L462 assume !(2 == ~wl_pc~0); 774#L463 assume !(1 == ~c1_pc~0); 846#L473 assume !(1 == ~c2_pc~0); 779#L482 assume !(1 == ~wb_pc~0); 822#L491 assume !(1 == ~e_c~0); 823#L500-1 assume !(1 == ~e_e~0); 780#L505-1 assume !(1 == ~e_f~0); 781#L510-1 assume !(1 == ~e_g~0); 827#L515-1 assume !(1 == ~e_c~0); 848#L520-1 assume !(1 == ~e_wl~0); 791#L662-1 [2019-11-28 03:46:02,657 INFO L796 eck$LassoCheckResult]: Loop: 791#L662-1 assume !false; 793#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 825#L367 assume !false; 755#L285 assume !(0 == ~wl_st~0); 757#L289 assume !(0 == ~c1_st~0); 855#L292 assume !(0 == ~c2_st~0); 835#L295 assume !(0 == ~wb_st~0); 836#L298 assume !(0 == ~r_st~0); 843#L383 start_simulation_~kernel_st~0 := 2; 812#L538 assume !(1 == ~c_req_up~0); 784#L538-2 start_simulation_~kernel_st~0 := 3; 785#L550 assume !(0 == ~e_f~0); 860#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 761#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 762#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 815#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 826#L570-1 assume 1 == ~wl_pc~0; 840#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 810#L583 assume !(1 == ~c1_pc~0); 805#L593 assume !(1 == ~c2_pc~0); 807#L602 assume !(1 == ~wb_pc~0); 818#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 838#L620-1 assume !(1 == ~e_e~0); 839#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 854#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 864#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 794#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 795#L645-1 assume 0 == ~wl_st~0; 791#L662-1 [2019-11-28 03:46:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-11-28 03:46:02,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410534423] [2019-11-28 03:46:02,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410534423] [2019-11-28 03:46:02,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680434727] [2019-11-28 03:46:02,710 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 3 times [2019-11-28 03:46:02,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244122405] [2019-11-28 03:46:02,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244122405] [2019-11-28 03:46:02,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935931876] [2019-11-28 03:46:02,781 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:02,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:02,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:02,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:02,782 INFO L87 Difference]: Start difference. First operand 119 states and 210 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-11-28 03:46:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:02,802 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2019-11-28 03:46:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:02,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 209 transitions. [2019-11-28 03:46:02,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 209 transitions. [2019-11-28 03:46:02,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-11-28 03:46:02,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-11-28 03:46:02,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 209 transitions. [2019-11-28 03:46:02,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:02,809 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-11-28 03:46:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 209 transitions. [2019-11-28 03:46:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-28 03:46:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 03:46:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 209 transitions. [2019-11-28 03:46:02,822 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-11-28 03:46:02,822 INFO L591 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2019-11-28 03:46:02,822 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:46:02,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 209 transitions. [2019-11-28 03:46:02,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2019-11-28 03:46:02,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:02,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:02,825 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,825 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:02,826 INFO L794 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1010#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1011#L394 assume !(1 == ~c_req_up~0); 1013#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1086#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1087#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1101#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 995#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 996#L425-1 assume !(0 == ~e_f~0); 1042#L430-1 assume !(0 == ~e_g~0); 1079#L435-1 assume !(0 == ~e_e~0); 1097#L440-1 assume !(0 == ~e_c~0); 1107#L445-1 assume !(0 == ~e_wl~0); 1032#L450-1 assume !(1 == ~wl_pc~0); 1033#L462 assume !(2 == ~wl_pc~0); 1019#L463 assume !(1 == ~c1_pc~0); 1091#L473 assume !(1 == ~c2_pc~0); 1024#L482 assume !(1 == ~wb_pc~0); 1067#L491 assume !(1 == ~e_c~0); 1068#L500-1 assume !(1 == ~e_e~0); 1025#L505-1 assume !(1 == ~e_f~0); 1026#L510-1 assume !(1 == ~e_g~0); 1072#L515-1 assume !(1 == ~e_c~0); 1093#L520-1 assume !(1 == ~e_wl~0); 1036#L662-1 [2019-11-28 03:46:02,826 INFO L796 eck$LassoCheckResult]: Loop: 1036#L662-1 assume !false; 1038#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1070#L367 assume !false; 1000#L285 assume !(0 == ~wl_st~0); 1002#L289 assume !(0 == ~c1_st~0); 1100#L292 assume !(0 == ~c2_st~0); 1080#L295 assume !(0 == ~wb_st~0); 1081#L298 assume !(0 == ~r_st~0); 1088#L383 start_simulation_~kernel_st~0 := 2; 1057#L538 assume !(1 == ~c_req_up~0); 1029#L538-2 start_simulation_~kernel_st~0 := 3; 1030#L550 assume !(0 == ~e_f~0); 1105#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1006#L555-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1007#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1060#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1071#L570-1 assume 1 == ~wl_pc~0; 1085#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1055#L583 assume !(1 == ~c1_pc~0); 1050#L593 assume !(1 == ~c2_pc~0); 1052#L602 assume !(1 == ~wb_pc~0); 1063#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1083#L620-1 assume !(1 == ~e_e~0); 1084#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1099#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1109#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1039#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1040#L645-1 assume 0 == ~wl_st~0; 1036#L662-1 [2019-11-28 03:46:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-11-28 03:46:02,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517660854] [2019-11-28 03:46:02,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:02,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2092883469, now seen corresponding path program 4 times [2019-11-28 03:46:02,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078140382] [2019-11-28 03:46:02,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078140382] [2019-11-28 03:46:02,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:02,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942300819] [2019-11-28 03:46:02,939 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:02,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:02,940 INFO L87 Difference]: Start difference. First operand 119 states and 209 transitions. cyclomatic complexity: 91 Second operand 3 states. [2019-11-28 03:46:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:03,006 INFO L93 Difference]: Finished difference Result 147 states and 260 transitions. [2019-11-28 03:46:03,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:03,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 260 transitions. [2019-11-28 03:46:03,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2019-11-28 03:46:03,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 260 transitions. [2019-11-28 03:46:03,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2019-11-28 03:46:03,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2019-11-28 03:46:03,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 260 transitions. [2019-11-28 03:46:03,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:03,018 INFO L688 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-11-28 03:46:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 260 transitions. [2019-11-28 03:46:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-11-28 03:46:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-28 03:46:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 260 transitions. [2019-11-28 03:46:03,037 INFO L711 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-11-28 03:46:03,037 INFO L591 BuchiCegarLoop]: Abstraction has 147 states and 260 transitions. [2019-11-28 03:46:03,037 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:46:03,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 260 transitions. [2019-11-28 03:46:03,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2019-11-28 03:46:03,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:03,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:03,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:03,046 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:03,046 INFO L794 eck$LassoCheckResult]: Stem: 1380#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1283#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1284#L394 assume !(1 == ~c_req_up~0); 1286#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1359#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1360#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1377#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1267#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1268#L425-1 assume !(0 == ~e_f~0); 1315#L430-1 assume !(0 == ~e_g~0); 1352#L435-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1372#L440-1 assume !(0 == ~e_c~0); 1383#L445-1 assume !(0 == ~e_wl~0); 1305#L450-1 assume !(1 == ~wl_pc~0); 1306#L462 assume !(2 == ~wl_pc~0); 1292#L463 assume !(1 == ~c1_pc~0); 1366#L473 assume !(1 == ~c2_pc~0); 1297#L482 assume !(1 == ~wb_pc~0); 1340#L491 assume !(1 == ~e_c~0); 1341#L500-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1298#L505-1 assume !(1 == ~e_f~0); 1299#L510-1 assume !(1 == ~e_g~0); 1345#L515-1 assume !(1 == ~e_c~0); 1368#L520-1 assume !(1 == ~e_wl~0); 1309#L662-1 [2019-11-28 03:46:03,048 INFO L796 eck$LassoCheckResult]: Loop: 1309#L662-1 assume !false; 1311#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1343#L367 assume !false; 1272#L285 assume !(0 == ~wl_st~0); 1274#L289 assume !(0 == ~c1_st~0); 1376#L292 assume !(0 == ~c2_st~0); 1353#L295 assume !(0 == ~wb_st~0); 1354#L298 assume !(0 == ~r_st~0); 1361#L383 start_simulation_~kernel_st~0 := 2; 1330#L538 assume !(1 == ~c_req_up~0); 1302#L538-2 start_simulation_~kernel_st~0 := 3; 1303#L550 assume !(0 == ~e_f~0); 1381#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1278#L555-1 assume !(0 == ~e_e~0); 1280#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1333#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1344#L570-1 assume 1 == ~wl_pc~0; 1358#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1328#L583 assume !(1 == ~c1_pc~0); 1323#L593 assume !(1 == ~c2_pc~0); 1325#L602 assume !(1 == ~wb_pc~0); 1389#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 1388#L620-1 assume !(1 == ~e_e~0); 1357#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1375#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1385#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1312#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1313#L645-1 assume 0 == ~wl_st~0; 1309#L662-1 [2019-11-28 03:46:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1264875287, now seen corresponding path program 1 times [2019-11-28 03:46:03,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:03,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930151424] [2019-11-28 03:46:03,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:03,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930151424] [2019-11-28 03:46:03,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:03,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:03,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168511667] [2019-11-28 03:46:03,103 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash 922220149, now seen corresponding path program 1 times [2019-11-28 03:46:03,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:03,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708607400] [2019-11-28 03:46:03,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:03,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:03,330 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-28 03:46:03,417 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:03,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:03,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:03,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:03,418 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:46:03,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:03,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:03,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2019-11-28 03:46:03,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:03,420 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:03,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,879 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:03,880 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:03,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:03,909 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:03,910 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:03,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:03,924 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:46:03,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:03,954 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:46:03,956 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:03,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:03,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:03,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:03,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:46:03,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:03,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:03,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2019-11-28 03:46:03,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:03,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:03,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:04,475 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:04,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:46:04,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:04,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:04,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:04,484 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:04,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:04,488 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:04,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:04,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:04,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:46:04,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:04,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:04,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:04,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:04,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:04,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:04,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:04,543 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:46:04,547 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:46:04,548 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:04,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:46:04,562 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:46:04,562 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:46:04,563 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-11-28 03:46:04,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:46:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:04,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:46:04,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:04,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:46:04,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:04,727 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:46:04,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-11-28 03:46:04,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 260 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 461 states and 811 transitions. Complement of second has 5 states. [2019-11-28 03:46:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:46:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:46:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2019-11-28 03:46:04,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 28 letters. [2019-11-28 03:46:04,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:04,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 52 letters. Loop has 28 letters. [2019-11-28 03:46:04,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:04,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 56 letters. [2019-11-28 03:46:04,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:04,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 811 transitions. [2019-11-28 03:46:04,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 306 [2019-11-28 03:46:04,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 461 states and 811 transitions. [2019-11-28 03:46:04,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2019-11-28 03:46:04,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2019-11-28 03:46:04,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 811 transitions. [2019-11-28 03:46:04,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:04,865 INFO L688 BuchiCegarLoop]: Abstraction has 461 states and 811 transitions. [2019-11-28 03:46:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 811 transitions. [2019-11-28 03:46:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 355. [2019-11-28 03:46:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-28 03:46:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 626 transitions. [2019-11-28 03:46:04,882 INFO L711 BuchiCegarLoop]: Abstraction has 355 states and 626 transitions. [2019-11-28 03:46:04,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:04,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:04,883 INFO L87 Difference]: Start difference. First operand 355 states and 626 transitions. Second operand 4 states. [2019-11-28 03:46:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:05,000 INFO L93 Difference]: Finished difference Result 595 states and 1033 transitions. [2019-11-28 03:46:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:46:05,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 1033 transitions. [2019-11-28 03:46:05,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2019-11-28 03:46:05,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 595 states and 1033 transitions. [2019-11-28 03:46:05,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2019-11-28 03:46:05,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2019-11-28 03:46:05,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 1033 transitions. [2019-11-28 03:46:05,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:05,013 INFO L688 BuchiCegarLoop]: Abstraction has 595 states and 1033 transitions. [2019-11-28 03:46:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 1033 transitions. [2019-11-28 03:46:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 559. [2019-11-28 03:46:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-11-28 03:46:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 976 transitions. [2019-11-28 03:46:05,036 INFO L711 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2019-11-28 03:46:05,036 INFO L591 BuchiCegarLoop]: Abstraction has 559 states and 976 transitions. [2019-11-28 03:46:05,036 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:46:05,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 559 states and 976 transitions. [2019-11-28 03:46:05,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 340 [2019-11-28 03:46:05,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:05,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:05,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,046 INFO L794 eck$LassoCheckResult]: Stem: 3220#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3036#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3037#L394 assume !(1 == ~c_req_up~0); 3039#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3182#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3183#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3212#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3008#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3009#L425-1 assume !(0 == ~e_f~0); 3090#L430-1 assume !(0 == ~e_g~0); 3169#L435-1 assume !(0 == ~e_e~0); 3202#L440-1 assume !(0 == ~e_c~0); 3234#L445-1 assume !(0 == ~e_wl~0); 3073#L450-1 assume !(1 == ~wl_pc~0); 3074#L462 assume !(2 == ~wl_pc~0); 3050#L463 assume !(1 == ~c1_pc~0); 3309#L473 assume !(1 == ~c2_pc~0); 3307#L482 assume !(1 == ~wb_pc~0); 3142#L491 assume !(1 == ~e_c~0); 3143#L500-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3252#L505-1 assume !(1 == ~e_f~0); 3060#L510-1 assume !(1 == ~e_g~0); 3287#L515-1 assume !(1 == ~e_c~0); 3225#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3226#L662-1 [2019-11-28 03:46:05,046 INFO L796 eck$LassoCheckResult]: Loop: 3226#L662-1 assume !false; 3376#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3372#L367 assume !false; 3369#L285 assume !(0 == ~wl_st~0); 3367#L289 assume !(0 == ~c1_st~0); 3364#L292 assume !(0 == ~c2_st~0); 3361#L295 assume !(0 == ~wb_st~0); 3357#L298 assume !(0 == ~r_st~0); 3352#L383 start_simulation_~kernel_st~0 := 2; 3347#L538 assume !(1 == ~c_req_up~0); 3343#L538-2 start_simulation_~kernel_st~0 := 3; 3341#L550 assume !(0 == ~e_f~0); 3337#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3338#L555-1 assume !(0 == ~e_e~0); 3335#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3336#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3455#L570-1 assume !(1 == ~wl_pc~0); 3451#L582 assume !(2 == ~wl_pc~0); 3447#L583 assume !(1 == ~c1_pc~0); 3443#L593 assume !(1 == ~c2_pc~0); 3439#L602 assume !(1 == ~wb_pc~0); 3435#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 3432#L620-1 assume !(1 == ~e_e~0); 3431#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3429#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3428#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3389#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3384#L645-1 assume 0 == ~wl_st~0; 3226#L662-1 [2019-11-28 03:46:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash 253758035, now seen corresponding path program 1 times [2019-11-28 03:46:05,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258526739] [2019-11-28 03:46:05,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258526739] [2019-11-28 03:46:05,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:05,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434524962] [2019-11-28 03:46:05,111 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 1 times [2019-11-28 03:46:05,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980125226] [2019-11-28 03:46:05,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980125226] [2019-11-28 03:46:05,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:05,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988801587] [2019-11-28 03:46:05,155 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:05,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:05,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:05,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:05,156 INFO L87 Difference]: Start difference. First operand 559 states and 976 transitions. cyclomatic complexity: 423 Second operand 4 states. [2019-11-28 03:46:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:05,252 INFO L93 Difference]: Finished difference Result 1029 states and 1741 transitions. [2019-11-28 03:46:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:46:05,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1029 states and 1741 transitions. [2019-11-28 03:46:05,264 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2019-11-28 03:46:05,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1029 states to 1029 states and 1741 transitions. [2019-11-28 03:46:05,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 706 [2019-11-28 03:46:05,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 706 [2019-11-28 03:46:05,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1029 states and 1741 transitions. [2019-11-28 03:46:05,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:05,277 INFO L688 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-11-28 03:46:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states and 1741 transitions. [2019-11-28 03:46:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2019-11-28 03:46:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-11-28 03:46:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1741 transitions. [2019-11-28 03:46:05,305 INFO L711 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-11-28 03:46:05,305 INFO L591 BuchiCegarLoop]: Abstraction has 1029 states and 1741 transitions. [2019-11-28 03:46:05,305 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:46:05,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1029 states and 1741 transitions. [2019-11-28 03:46:05,314 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 638 [2019-11-28 03:46:05,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:05,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:05,315 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,315 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,315 INFO L794 eck$LassoCheckResult]: Stem: 4819#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4635#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4636#L394 assume !(1 == ~c_req_up~0); 4794#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4861#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4812#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4813#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4607#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4608#L425-1 assume !(0 == ~e_f~0); 4766#L430-1 assume !(0 == ~e_g~0); 4767#L435-1 assume !(0 == ~e_e~0); 4828#L440-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4829#L445-1 assume !(0 == ~e_wl~0); 4860#L450-1 assume !(1 == ~wl_pc~0); 4858#L462 assume !(2 == ~wl_pc~0); 4856#L463 assume !(1 == ~c1_pc~0); 4827#L473 assume !(1 == ~c2_pc~0); 4656#L482 assume !(1 == ~wb_pc~0); 4789#L491 assume !(1 == ~e_c~0); 4846#L500-1 assume !(1 == ~e_e~0); 4847#L505-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4864#L510-1 assume !(1 == ~e_g~0); 4865#L515-1 assume !(1 == ~e_c~0); 4938#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4675#L662-1 [2019-11-28 03:46:05,315 INFO L796 eck$LassoCheckResult]: Loop: 4675#L662-1 assume !false; 4680#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 4748#L367 assume !false; 4615#L285 assume !(0 == ~wl_st~0); 4617#L289 assume !(0 == ~c1_st~0); 4810#L292 assume !(0 == ~c2_st~0); 4768#L295 assume !(0 == ~wb_st~0); 4769#L298 assume !(0 == ~r_st~0); 4783#L383 start_simulation_~kernel_st~0 := 2; 4718#L538 assume !(1 == ~c_req_up~0); 4720#L538-2 start_simulation_~kernel_st~0 := 3; 5107#L550 assume !(0 == ~e_f~0); 4823#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4627#L555-1 assume !(0 == ~e_e~0); 4628#L560-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5144#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5142#L570-1 assume !(1 == ~wl_pc~0); 5138#L582 assume !(2 == ~wl_pc~0); 5136#L583 assume !(1 == ~c1_pc~0); 5134#L593 assume !(1 == ~c2_pc~0); 5102#L602 assume !(1 == ~wb_pc~0); 5101#L611 assume 1 == ~e_c~0;~r_st~0 := 0; 5121#L620-1 assume !(1 == ~e_e~0); 5120#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5119#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5118#L635-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4682#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4683#L645-1 assume 0 == ~wl_st~0; 4675#L662-1 [2019-11-28 03:46:05,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,316 INFO L82 PathProgramCache]: Analyzing trace with hash 842351509, now seen corresponding path program 1 times [2019-11-28 03:46:05,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948415908] [2019-11-28 03:46:05,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948415908] [2019-11-28 03:46:05,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:05,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419407424] [2019-11-28 03:46:05,356 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1471479870, now seen corresponding path program 2 times [2019-11-28 03:46:05,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62562909] [2019-11-28 03:46:05,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62562909] [2019-11-28 03:46:05,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:05,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232517782] [2019-11-28 03:46:05,386 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:05,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:05,387 INFO L87 Difference]: Start difference. First operand 1029 states and 1741 transitions. cyclomatic complexity: 724 Second operand 4 states. [2019-11-28 03:46:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:05,514 INFO L93 Difference]: Finished difference Result 1300 states and 2165 transitions. [2019-11-28 03:46:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:46:05,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1300 states and 2165 transitions. [2019-11-28 03:46:05,530 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2019-11-28 03:46:05,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1300 states to 1300 states and 2165 transitions. [2019-11-28 03:46:05,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 892 [2019-11-28 03:46:05,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 892 [2019-11-28 03:46:05,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1300 states and 2165 transitions. [2019-11-28 03:46:05,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:05,549 INFO L688 BuchiCegarLoop]: Abstraction has 1300 states and 2165 transitions. [2019-11-28 03:46:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states and 2165 transitions. [2019-11-28 03:46:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1276. [2019-11-28 03:46:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-11-28 03:46:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 2141 transitions. [2019-11-28 03:46:05,582 INFO L711 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2019-11-28 03:46:05,582 INFO L591 BuchiCegarLoop]: Abstraction has 1276 states and 2141 transitions. [2019-11-28 03:46:05,582 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:46:05,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1276 states and 2141 transitions. [2019-11-28 03:46:05,591 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 808 [2019-11-28 03:46:05,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:05,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:05,592 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,592 INFO L794 eck$LassoCheckResult]: Stem: 7178#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6974#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6975#L394 assume !(1 == ~c_req_up~0); 7146#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7130#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7131#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7197#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6946#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6947#L425-1 assume !(0 == ~e_f~0); 7113#L430-1 assume !(0 == ~e_g~0); 7114#L435-1 assume !(0 == ~e_e~0); 7189#L440-1 assume !(0 == ~e_c~0); 7190#L445-1 assume !(0 == ~e_wl~0); 7012#L450-1 assume !(1 == ~wl_pc~0); 7013#L462 assume !(2 == ~wl_pc~0); 6994#L463 assume !(1 == ~c1_pc~0); 7139#L473 assume !(1 == ~c2_pc~0); 7217#L482 assume !(1 == ~wb_pc~0); 7082#L491 assume !(1 == ~e_c~0); 7083#L500-1 assume !(1 == ~e_e~0); 7211#L505-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7093#L510-1 assume !(1 == ~e_g~0); 7094#L515-1 assume !(1 == ~e_c~0); 7180#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7181#L662-1 [2019-11-28 03:46:05,592 INFO L796 eck$LassoCheckResult]: Loop: 7181#L662-1 assume !false; 7910#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7615#L367 assume !false; 7905#L285 assume !(0 == ~wl_st~0); 7906#L289 assume !(0 == ~c1_st~0); 7908#L292 assume !(0 == ~c2_st~0); 7903#L295 assume !(0 == ~wb_st~0); 7904#L298 assume !(0 == ~r_st~0); 7907#L383 start_simulation_~kernel_st~0 := 2; 7939#L538 assume !(1 == ~c_req_up~0); 7937#L538-2 start_simulation_~kernel_st~0 := 3; 7936#L550 assume !(0 == ~e_f~0); 7935#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7934#L555-1 assume !(0 == ~e_e~0); 7933#L560-1 assume !(0 == ~e_c~0); 7932#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 7931#L570-1 assume !(1 == ~wl_pc~0); 7928#L582 assume !(2 == ~wl_pc~0); 7927#L583 assume !(1 == ~c1_pc~0); 7925#L593 assume !(1 == ~c2_pc~0); 7923#L602 assume !(1 == ~wb_pc~0); 7921#L611 assume !(1 == ~e_c~0); 7920#L620-1 assume !(1 == ~e_e~0); 7919#L625-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7780#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7918#L635-1 assume !(1 == ~e_c~0); 7916#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7915#L645-1 assume 0 == ~wl_st~0; 7181#L662-1 [2019-11-28 03:46:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2019-11-28 03:46:05,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059504242] [2019-11-28 03:46:05,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059504242] [2019-11-28 03:46:05,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:05,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222859194] [2019-11-28 03:46:05,645 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:05,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2059595392, now seen corresponding path program 1 times [2019-11-28 03:46:05,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323994753] [2019-11-28 03:46:05,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323994753] [2019-11-28 03:46:05,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:05,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113537962] [2019-11-28 03:46:05,678 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:05,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:05,679 INFO L87 Difference]: Start difference. First operand 1276 states and 2141 transitions. cyclomatic complexity: 880 Second operand 4 states. [2019-11-28 03:46:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:05,797 INFO L93 Difference]: Finished difference Result 1415 states and 2300 transitions. [2019-11-28 03:46:05,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:46:05,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1415 states and 2300 transitions. [2019-11-28 03:46:05,810 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 891 [2019-11-28 03:46:05,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1415 states to 1415 states and 2300 transitions. [2019-11-28 03:46:05,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 967 [2019-11-28 03:46:05,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 967 [2019-11-28 03:46:05,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1415 states and 2300 transitions. [2019-11-28 03:46:05,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:05,832 INFO L688 BuchiCegarLoop]: Abstraction has 1415 states and 2300 transitions. [2019-11-28 03:46:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states and 2300 transitions. [2019-11-28 03:46:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1385. [2019-11-28 03:46:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-11-28 03:46:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2270 transitions. [2019-11-28 03:46:05,864 INFO L711 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2019-11-28 03:46:05,864 INFO L591 BuchiCegarLoop]: Abstraction has 1385 states and 2270 transitions. [2019-11-28 03:46:05,865 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:46:05,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1385 states and 2270 transitions. [2019-11-28 03:46:05,873 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 887 [2019-11-28 03:46:05,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:05,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:05,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,876 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:05,876 INFO L794 eck$LassoCheckResult]: Stem: 9877#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9678#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9679#L394 assume !(1 == ~c_req_up~0); 9681#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9833#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9834#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9896#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9648#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9649#L425-1 assume !(0 == ~e_f~0); 9815#L430-1 assume !(0 == ~e_g~0); 9816#L435-1 assume !(0 == ~e_e~0); 9884#L440-1 assume !(0 == ~e_c~0); 9885#L445-1 assume !(0 == ~e_wl~0); 9715#L450-1 assume !(1 == ~wl_pc~0); 9716#L462 assume !(2 == ~wl_pc~0); 9692#L463 assume !(1 == ~c1_pc~0); 9840#L473 assume !(1 == ~c2_pc~0); 9919#L482 assume !(1 == ~wb_pc~0); 9785#L491 assume !(1 == ~e_c~0); 9786#L500-1 assume !(1 == ~e_e~0); 9911#L505-1 assume !(1 == ~e_f~0); 9796#L510-1 assume !(1 == ~e_g~0); 9797#L515-1 assume !(1 == ~e_c~0); 9843#L520-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9719#L662-1 [2019-11-28 03:46:05,876 INFO L796 eck$LassoCheckResult]: Loop: 9719#L662-1 assume !false; 9724#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 9791#L367 assume !false; 9656#L285 assume !(0 == ~wl_st~0); 9658#L289 assume !(0 == ~c1_st~0); 9865#L292 assume !(0 == ~c2_st~0); 9817#L295 assume !(0 == ~wb_st~0); 9818#L298 assume !(0 == ~r_st~0); 9835#L383 start_simulation_~kernel_st~0 := 2; 9763#L538 assume !(1 == ~c_req_up~0); 9707#L538-2 start_simulation_~kernel_st~0 := 3; 9708#L550 assume !(0 == ~e_f~0); 9900#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10712#L555-1 assume !(0 == ~e_e~0); 10713#L560-1 assume !(0 == ~e_c~0); 10705#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10706#L570-1 assume !(1 == ~wl_pc~0); 11014#L582 assume !(2 == ~wl_pc~0); 10692#L583 assume !(1 == ~c1_pc~0); 10691#L593 assume !(1 == ~c2_pc~0); 10686#L602 assume !(1 == ~wb_pc~0); 10684#L611 assume !(1 == ~e_c~0); 10683#L620-1 assume !(1 == ~e_e~0); 10682#L625-1 assume !(1 == ~e_f~0); 10681#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10679#L635-1 assume !(1 == ~e_c~0); 10680#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 9777#L645-1 assume 0 == ~wl_st~0; 9719#L662-1 [2019-11-28 03:46:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2019-11-28 03:46:05,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678534851] [2019-11-28 03:46:05,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678534851] [2019-11-28 03:46:05,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:05,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371916660] [2019-11-28 03:46:05,909 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2057748350, now seen corresponding path program 1 times [2019-11-28 03:46:05,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:05,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039436260] [2019-11-28 03:46:05,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:05,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039436260] [2019-11-28 03:46:05,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:05,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:05,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420481968] [2019-11-28 03:46:05,926 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:05,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:05,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:05,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:05,927 INFO L87 Difference]: Start difference. First operand 1385 states and 2270 transitions. cyclomatic complexity: 900 Second operand 3 states. [2019-11-28 03:46:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:05,978 INFO L93 Difference]: Finished difference Result 2200 states and 3552 transitions. [2019-11-28 03:46:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:05,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2200 states and 3552 transitions. [2019-11-28 03:46:05,998 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1264 [2019-11-28 03:46:06,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2200 states to 2200 states and 3552 transitions. [2019-11-28 03:46:06,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1324 [2019-11-28 03:46:06,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1324 [2019-11-28 03:46:06,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2200 states and 3552 transitions. [2019-11-28 03:46:06,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:06,018 INFO L688 BuchiCegarLoop]: Abstraction has 2200 states and 3552 transitions. [2019-11-28 03:46:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states and 3552 transitions. [2019-11-28 03:46:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2188. [2019-11-28 03:46:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-11-28 03:46:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3540 transitions. [2019-11-28 03:46:06,068 INFO L711 BuchiCegarLoop]: Abstraction has 2188 states and 3540 transitions. [2019-11-28 03:46:06,068 INFO L591 BuchiCegarLoop]: Abstraction has 2188 states and 3540 transitions. [2019-11-28 03:46:06,068 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:46:06,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2188 states and 3540 transitions. [2019-11-28 03:46:06,082 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1257 [2019-11-28 03:46:06,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:06,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:06,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:06,083 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:06,083 INFO L794 eck$LassoCheckResult]: Stem: 13464#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 13268#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 13269#L394 assume !(1 == ~c_req_up~0); 13436#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 13418#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 13419#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 13483#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 13240#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 13241#L425-1 assume !(0 == ~e_f~0); 13400#L430-1 assume !(0 == ~e_g~0); 13401#L435-1 assume !(0 == ~e_e~0); 13475#L440-1 assume !(0 == ~e_c~0); 13476#L445-1 assume !(0 == ~e_wl~0); 13511#L450-1 assume !(1 == ~wl_pc~0); 13472#L462 assume !(2 == ~wl_pc~0); 13287#L463 assume !(1 == ~c1_pc~0); 13426#L473 assume !(1 == ~c2_pc~0); 13505#L482 assume !(1 == ~wb_pc~0); 13374#L491 assume !(1 == ~e_c~0); 13375#L500-1 assume !(1 == ~e_e~0); 13503#L505-1 assume !(1 == ~e_f~0); 13382#L510-1 assume !(1 == ~e_g~0); 13383#L515-1 assume !(1 == ~e_c~0); 13433#L520-1 assume !(1 == ~e_wl~0); 13586#L662-1 assume !false; 13587#L532 [2019-11-28 03:46:06,084 INFO L796 eck$LassoCheckResult]: Loop: 13587#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 14882#L367 assume !false; 14715#L285 assume !(0 == ~wl_st~0); 14712#L289 assume !(0 == ~c1_st~0); 14709#L292 assume !(0 == ~c2_st~0); 14706#L295 assume !(0 == ~wb_st~0); 14700#L298 assume !(0 == ~r_st~0); 14702#L383 start_simulation_~kernel_st~0 := 2; 14688#L538 assume !(1 == ~c_req_up~0); 14689#L538-2 start_simulation_~kernel_st~0 := 3; 14972#L550 assume !(0 == ~e_f~0); 14971#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 14970#L555-1 assume !(0 == ~e_e~0); 14969#L560-1 assume !(0 == ~e_c~0); 14968#L565-1 assume !(0 == ~e_wl~0); 14967#L570-1 assume !(1 == ~wl_pc~0); 14964#L582 assume !(2 == ~wl_pc~0); 14963#L583 assume !(1 == ~c1_pc~0); 14961#L593 assume !(1 == ~c2_pc~0); 14959#L602 assume !(1 == ~wb_pc~0); 14957#L611 assume !(1 == ~e_c~0); 14956#L620-1 assume !(1 == ~e_e~0); 14955#L625-1 assume !(1 == ~e_f~0); 14951#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 14945#L635-1 assume !(1 == ~e_c~0); 14942#L640-1 assume !(1 == ~e_wl~0); 14770#L645-1 assume 0 == ~wl_st~0; 14885#L662-1 assume !false; 13587#L532 [2019-11-28 03:46:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2019-11-28 03:46:06,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:06,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063533758] [2019-11-28 03:46:06,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,118 INFO L82 PathProgramCache]: Analyzing trace with hash 793828832, now seen corresponding path program 1 times [2019-11-28 03:46:06,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:06,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310563294] [2019-11-28 03:46:06,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:06,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310563294] [2019-11-28 03:46:06,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:06,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:06,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978486459] [2019-11-28 03:46:06,141 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:06,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:06,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:06,143 INFO L87 Difference]: Start difference. First operand 2188 states and 3540 transitions. cyclomatic complexity: 1364 Second operand 3 states. [2019-11-28 03:46:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:06,189 INFO L93 Difference]: Finished difference Result 3269 states and 5252 transitions. [2019-11-28 03:46:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:06,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3269 states and 5252 transitions. [2019-11-28 03:46:06,216 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1877 [2019-11-28 03:46:06,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3269 states to 3269 states and 5252 transitions. [2019-11-28 03:46:06,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1948 [2019-11-28 03:46:06,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1948 [2019-11-28 03:46:06,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3269 states and 5252 transitions. [2019-11-28 03:46:06,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:06,245 INFO L688 BuchiCegarLoop]: Abstraction has 3269 states and 5252 transitions. [2019-11-28 03:46:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states and 5252 transitions. [2019-11-28 03:46:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3190. [2019-11-28 03:46:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2019-11-28 03:46:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 5137 transitions. [2019-11-28 03:46:06,321 INFO L711 BuchiCegarLoop]: Abstraction has 3190 states and 5137 transitions. [2019-11-28 03:46:06,322 INFO L591 BuchiCegarLoop]: Abstraction has 3190 states and 5137 transitions. [2019-11-28 03:46:06,322 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:46:06,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3190 states and 5137 transitions. [2019-11-28 03:46:06,338 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1871 [2019-11-28 03:46:06,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:06,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:06,340 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:06,340 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:06,340 INFO L794 eck$LassoCheckResult]: Stem: 18937#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 18729#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 18730#L394 assume !(1 == ~c_req_up~0); 18899#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 18881#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 18882#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 18958#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 18703#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 18704#L425-1 assume !(0 == ~e_f~0); 18865#L430-1 assume !(0 == ~e_g~0); 18866#L435-1 assume !(0 == ~e_e~0); 18947#L440-1 assume !(0 == ~e_c~0); 18948#L445-1 assume !(0 == ~e_wl~0); 18996#L450-1 assume !(1 == ~wl_pc~0); 18945#L462 assume !(2 == ~wl_pc~0); 18749#L463 assume !(1 == ~c1_pc~0); 18891#L473 assume !(1 == ~c2_pc~0); 18990#L482 assume !(1 == ~wb_pc~0); 18837#L491 assume !(1 == ~e_c~0); 18838#L500-1 assume !(1 == ~e_e~0); 18988#L505-1 assume !(1 == ~e_f~0); 18846#L510-1 assume !(1 == ~e_g~0); 18847#L515-1 assume !(1 == ~e_c~0); 18896#L520-1 assume !(1 == ~e_wl~0); 19113#L662-1 assume !false; 19114#L532 [2019-11-28 03:46:06,340 INFO L796 eck$LassoCheckResult]: Loop: 19114#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 21096#L367 assume !false; 21094#L285 assume 0 == ~wl_st~0; 21092#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 21090#L311 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 21025#L56 assume 0 == ~wl_pc~0; 21024#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 20906#L307 assume !(0 == ~c1_st~0); 20970#L322 assume !(0 == ~c2_st~0); 20956#L337 assume !(0 == ~wb_st~0); 20724#L352 assume !(0 == ~r_st~0); 20721#L367 assume !false; 20704#L285 assume !(0 == ~wl_st~0); 20705#L289 assume !(0 == ~c1_st~0); 20658#L292 assume !(0 == ~c2_st~0); 20659#L295 assume !(0 == ~wb_st~0); 20640#L298 assume !(0 == ~r_st~0); 20642#L383 start_simulation_~kernel_st~0 := 2; 20629#L538 assume !(1 == ~c_req_up~0); 20630#L538-2 start_simulation_~kernel_st~0 := 3; 20944#L550 assume !(0 == ~e_f~0); 20942#L550-2 assume 0 == ~e_g~0;~e_g~0 := 1; 20940#L555-1 assume !(0 == ~e_e~0); 20938#L560-1 assume !(0 == ~e_c~0); 20936#L565-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 20934#L570-1 assume 1 == ~wl_pc~0; 20931#L576 assume 1 == ~e_wl~0;~wl_st~0 := 0; 20928#L583 assume !(1 == ~c1_pc~0); 20924#L593 assume !(1 == ~c2_pc~0); 20920#L602 assume !(1 == ~wb_pc~0); 20916#L611 assume !(1 == ~e_c~0); 20908#L620-1 assume !(1 == ~e_e~0); 20767#L625-1 assume !(1 == ~e_f~0); 20763#L630-1 assume 1 == ~e_g~0;~e_g~0 := 2; 20760#L635-1 assume !(1 == ~e_c~0); 20753#L640-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 20754#L645-1 assume 0 == ~wl_st~0; 21099#L662-1 assume !false; 19114#L532 [2019-11-28 03:46:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2019-11-28 03:46:06,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:06,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365762515] [2019-11-28 03:46:06,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash 828679061, now seen corresponding path program 1 times [2019-11-28 03:46:06,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:06,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259835451] [2019-11-28 03:46:06,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1088220784, now seen corresponding path program 1 times [2019-11-28 03:46:06,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:06,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478774006] [2019-11-28 03:46:06,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:06,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478774006] [2019-11-28 03:46:06,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:06,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:06,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839849578] [2019-11-28 03:46:06,564 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-11-28 03:46:06,622 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:06,622 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:06,622 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:06,622 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:06,623 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:46:06,623 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,623 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:06,623 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:06,623 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2019-11-28 03:46:06,623 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:06,624 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:06,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:06,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,090 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:07,090 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:07,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:07,110 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:07,110 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:07,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:07,121 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:07,121 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=-1} Honda state: {~e_c~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:07,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:07,176 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:07,176 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:07,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:07,200 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:46:07,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:07,228 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:46:07,231 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:07,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:07,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:07,231 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:07,231 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:46:07,231 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,231 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:07,231 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:07,231 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration12_Loop [2019-11-28 03:46:07,232 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:07,232 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:07,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:07,643 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:07,643 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:46:07,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:07,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:07,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:07,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:07,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:07,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:07,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:07,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:46:07,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:07,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:07,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:07,679 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:07,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:07,680 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:07,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:07,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:46:07,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:07,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:07,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:07,697 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:07,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:07,702 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:07,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:07,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:46:07,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:07,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:07,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:07,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:07,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:07,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:07,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:07,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:46:07,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:46:07,729 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:07,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:46:07,743 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:46:07,743 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:46:07,743 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2019-11-28 03:46:07,746 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:07,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:46:07,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:07,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:46:07,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:07,881 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:46:07,881 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3190 states and 5137 transitions. cyclomatic complexity: 1965 Second operand 5 states. [2019-11-28 03:46:08,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3190 states and 5137 transitions. cyclomatic complexity: 1965. Second operand 5 states. Result 8418 states and 13557 transitions. Complement of second has 7 states. [2019-11-28 03:46:08,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:46:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:46:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2019-11-28 03:46:08,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 25 letters. Loop has 38 letters. [2019-11-28 03:46:08,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:08,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 63 letters. Loop has 38 letters. [2019-11-28 03:46:08,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:08,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 198 transitions. Stem has 25 letters. Loop has 76 letters. [2019-11-28 03:46:08,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:08,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8418 states and 13557 transitions. [2019-11-28 03:46:08,119 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 3355 [2019-11-28 03:46:08,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8418 states to 8248 states and 13287 transitions. [2019-11-28 03:46:08,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3562 [2019-11-28 03:46:08,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3576 [2019-11-28 03:46:08,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8248 states and 13287 transitions. [2019-11-28 03:46:08,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:08,208 INFO L688 BuchiCegarLoop]: Abstraction has 8248 states and 13287 transitions. [2019-11-28 03:46:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states and 13287 transitions. [2019-11-28 03:46:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 8064. [2019-11-28 03:46:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2019-11-28 03:46:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 13001 transitions. [2019-11-28 03:46:08,437 INFO L711 BuchiCegarLoop]: Abstraction has 8064 states and 13001 transitions. [2019-11-28 03:46:08,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:08,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:08,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:08,439 INFO L87 Difference]: Start difference. First operand 8064 states and 13001 transitions. Second operand 3 states. [2019-11-28 03:46:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:08,545 INFO L93 Difference]: Finished difference Result 12318 states and 19757 transitions. [2019-11-28 03:46:08,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:08,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12318 states and 19757 transitions. [2019-11-28 03:46:08,648 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5136 [2019-11-28 03:46:08,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12318 states to 12318 states and 19757 transitions. [2019-11-28 03:46:08,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5280 [2019-11-28 03:46:08,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5280 [2019-11-28 03:46:08,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12318 states and 19757 transitions. [2019-11-28 03:46:08,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:08,749 INFO L688 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-11-28 03:46:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12318 states and 19757 transitions. [2019-11-28 03:46:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12318 to 12318. [2019-11-28 03:46:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12318 states. [2019-11-28 03:46:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12318 states to 12318 states and 19757 transitions. [2019-11-28 03:46:08,990 INFO L711 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-11-28 03:46:08,990 INFO L591 BuchiCegarLoop]: Abstraction has 12318 states and 19757 transitions. [2019-11-28 03:46:08,990 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:46:08,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12318 states and 19757 transitions. [2019-11-28 03:46:09,038 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 5136 [2019-11-28 03:46:09,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:09,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:09,039 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:09,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:09,039 INFO L794 eck$LassoCheckResult]: Stem: 51148#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 50935#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 50936#L394 assume !(1 == ~c_req_up~0); 50938#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 51101#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 51132#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 51133#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 51201#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 50987#L425-1 assume !(0 == ~e_f~0); 50988#L430-1 assume !(0 == ~e_g~0); 51121#L435-1 assume !(0 == ~e_e~0); 51122#L440-1 assume !(0 == ~e_c~0); 51200#L445-1 assume !(0 == ~e_wl~0); 51199#L450-1 assume !(1 == ~wl_pc~0); 51156#L462 assume !(2 == ~wl_pc~0); 50946#L463 assume !(1 == ~c1_pc~0); 51105#L473 assume !(1 == ~c2_pc~0); 51193#L482 assume !(1 == ~wb_pc~0); 51045#L491 assume !(1 == ~e_c~0); 51046#L500-1 assume !(1 == ~e_e~0); 51183#L505-1 assume !(1 == ~e_f~0); 51053#L510-1 assume !(1 == ~e_g~0); 51054#L515-1 assume !(1 == ~e_c~0); 51111#L520-1 assume !(1 == ~e_wl~0); 52954#L662-1 assume !false; 52952#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 52953#L367 [2019-11-28 03:46:09,039 INFO L796 eck$LassoCheckResult]: Loop: 52953#L367 assume !false; 57733#L285 assume 0 == ~wl_st~0; 56476#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 51208#L311 assume !(0 != eval_~tmp~0); 51209#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 56471#L326 assume !(0 != eval_~tmp___0~0); 56472#L322 assume !(0 == ~c2_st~0); 57737#L337 assume !(0 == ~wb_st~0); 57736#L352 assume !(0 == ~r_st~0); 52953#L367 [2019-11-28 03:46:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-11-28 03:46:09,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:09,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733247106] [2019-11-28 03:46:09,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 1 times [2019-11-28 03:46:09,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:09,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498511175] [2019-11-28 03:46:09,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,078 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1866895320, now seen corresponding path program 1 times [2019-11-28 03:46:09,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:09,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943623054] [2019-11-28 03:46:09,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:09,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943623054] [2019-11-28 03:46:09,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:09,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:09,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873234272] [2019-11-28 03:46:09,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:09,168 INFO L87 Difference]: Start difference. First operand 12318 states and 19757 transitions. cyclomatic complexity: 7495 Second operand 3 states. [2019-11-28 03:46:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:09,308 INFO L93 Difference]: Finished difference Result 19296 states and 30676 transitions. [2019-11-28 03:46:09,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:09,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19296 states and 30676 transitions. [2019-11-28 03:46:09,436 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-11-28 03:46:09,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19296 states to 19296 states and 30676 transitions. [2019-11-28 03:46:09,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8284 [2019-11-28 03:46:09,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8284 [2019-11-28 03:46:09,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19296 states and 30676 transitions. [2019-11-28 03:46:09,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:09,548 INFO L688 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-11-28 03:46:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19296 states and 30676 transitions. [2019-11-28 03:46:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19296 to 19296. [2019-11-28 03:46:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19296 states. [2019-11-28 03:46:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19296 states to 19296 states and 30676 transitions. [2019-11-28 03:46:10,120 INFO L711 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-11-28 03:46:10,120 INFO L591 BuchiCegarLoop]: Abstraction has 19296 states and 30676 transitions. [2019-11-28 03:46:10,120 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 03:46:10,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19296 states and 30676 transitions. [2019-11-28 03:46:10,195 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-11-28 03:46:10,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:10,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:10,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:10,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:10,197 INFO L794 eck$LassoCheckResult]: Stem: 82778#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 82559#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 82560#L394 assume !(1 == ~c_req_up~0); 82723#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 82724#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 82764#L410-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 82765#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 82852#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 82618#L425-1 assume !(0 == ~e_f~0); 82619#L430-1 assume !(0 == ~e_g~0); 82749#L435-1 assume !(0 == ~e_e~0); 82750#L440-1 assume !(0 == ~e_c~0); 82818#L445-1 assume !(0 == ~e_wl~0); 82595#L450-1 assume !(1 == ~wl_pc~0); 82596#L462 assume !(2 == ~wl_pc~0); 82839#L463 assume !(1 == ~c1_pc~0); 82838#L473 assume !(1 == ~c2_pc~0); 82734#L482 assume !(1 == ~wb_pc~0); 82735#L491 assume !(1 == ~e_c~0); 82827#L500-1 assume !(1 == ~e_e~0); 82828#L505-1 assume !(1 == ~e_f~0); 82679#L510-1 assume !(1 == ~e_g~0); 82680#L515-1 assume !(1 == ~e_c~0); 82782#L520-1 assume !(1 == ~e_wl~0); 82783#L662-1 assume !false; 85002#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 91209#L367 [2019-11-28 03:46:10,198 INFO L796 eck$LassoCheckResult]: Loop: 91209#L367 assume !false; 91201#L285 assume 0 == ~wl_st~0; 91190#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 91180#L311 assume !(0 != eval_~tmp~0); 91181#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91280#L326 assume !(0 != eval_~tmp___0~0); 91277#L322 assume !(0 == ~c2_st~0); 91227#L337 assume !(0 == ~wb_st~0); 91223#L352 assume !(0 == ~r_st~0); 91209#L367 [2019-11-28 03:46:10,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-11-28 03:46:10,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:10,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709406136] [2019-11-28 03:46:10,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:10,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709406136] [2019-11-28 03:46:10,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:10,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:10,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399941243] [2019-11-28 03:46:10,220 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash 850890528, now seen corresponding path program 2 times [2019-11-28 03:46:10,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:10,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511919977] [2019-11-28 03:46:10,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:10,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:10,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:10,267 INFO L87 Difference]: Start difference. First operand 19296 states and 30676 transitions. cyclomatic complexity: 11436 Second operand 3 states. [2019-11-28 03:46:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:10,342 INFO L93 Difference]: Finished difference Result 19244 states and 30595 transitions. [2019-11-28 03:46:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:10,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19244 states and 30595 transitions. [2019-11-28 03:46:10,431 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-11-28 03:46:10,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19244 states to 19244 states and 30595 transitions. [2019-11-28 03:46:10,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8234 [2019-11-28 03:46:10,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8234 [2019-11-28 03:46:10,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19244 states and 30595 transitions. [2019-11-28 03:46:10,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:10,522 INFO L688 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-11-28 03:46:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states and 30595 transitions. [2019-11-28 03:46:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 19244. [2019-11-28 03:46:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19244 states. [2019-11-28 03:46:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19244 states to 19244 states and 30595 transitions. [2019-11-28 03:46:10,851 INFO L711 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-11-28 03:46:10,851 INFO L591 BuchiCegarLoop]: Abstraction has 19244 states and 30595 transitions. [2019-11-28 03:46:10,851 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 03:46:10,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19244 states and 30595 transitions. [2019-11-28 03:46:10,916 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 8024 [2019-11-28 03:46:10,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:10,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:10,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:10,923 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:10,923 INFO L794 eck$LassoCheckResult]: Stem: 121318#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 121105#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 121106#L394 assume !(1 == ~c_req_up~0); 121108#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 121271#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 121307#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 121308#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 121369#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 121158#L425-1 assume !(0 == ~e_f~0); 121159#L430-1 assume !(0 == ~e_g~0); 121289#L435-1 assume !(0 == ~e_e~0); 121290#L440-1 assume !(0 == ~e_c~0); 121368#L445-1 assume !(0 == ~e_wl~0); 121367#L450-1 assume !(1 == ~wl_pc~0); 121326#L462 assume !(2 == ~wl_pc~0); 121116#L463 assume !(1 == ~c1_pc~0); 121275#L473 assume !(1 == ~c2_pc~0); 121361#L482 assume !(1 == ~wb_pc~0); 121214#L491 assume !(1 == ~e_c~0); 121215#L500-1 assume !(1 == ~e_e~0); 121351#L505-1 assume !(1 == ~e_f~0); 121224#L510-1 assume !(1 == ~e_g~0); 121225#L515-1 assume !(1 == ~e_c~0); 121279#L520-1 assume !(1 == ~e_wl~0); 121319#L662-1 assume !false; 122901#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 129788#L367 [2019-11-28 03:46:10,924 INFO L796 eck$LassoCheckResult]: Loop: 129788#L367 assume !false; 129783#L285 assume 0 == ~wl_st~0; 129780#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 129776#L311 assume !(0 != eval_~tmp~0); 129777#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 129594#L326 assume !(0 != eval_~tmp___0~0); 129826#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 129804#L341 assume !(0 != eval_~tmp___1~0); 129799#L337 assume !(0 == ~wb_st~0); 129796#L352 assume !(0 == ~r_st~0); 129788#L367 [2019-11-28 03:46:10,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-11-28 03:46:10,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:10,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341744613] [2019-11-28 03:46:10,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:10,942 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash 606182616, now seen corresponding path program 1 times [2019-11-28 03:46:10,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:10,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215607340] [2019-11-28 03:46:10,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:10,951 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:10,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2040800048, now seen corresponding path program 1 times [2019-11-28 03:46:10,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:10,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36817489] [2019-11-28 03:46:10,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:10,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36817489] [2019-11-28 03:46:10,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:10,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:10,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397999274] [2019-11-28 03:46:11,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:11,017 INFO L87 Difference]: Start difference. First operand 19244 states and 30595 transitions. cyclomatic complexity: 11407 Second operand 3 states. [2019-11-28 03:46:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:11,142 INFO L93 Difference]: Finished difference Result 33096 states and 52188 transitions. [2019-11-28 03:46:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:11,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33096 states and 52188 transitions. [2019-11-28 03:46:11,280 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 13770 [2019-11-28 03:46:11,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33096 states to 33096 states and 52188 transitions. [2019-11-28 03:46:11,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14128 [2019-11-28 03:46:11,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14128 [2019-11-28 03:46:11,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33096 states and 52188 transitions. [2019-11-28 03:46:11,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:11,439 INFO L688 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-11-28 03:46:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33096 states and 52188 transitions. [2019-11-28 03:46:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33096 to 33096. [2019-11-28 03:46:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33096 states. [2019-11-28 03:46:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33096 states to 33096 states and 52188 transitions. [2019-11-28 03:46:12,161 INFO L711 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-11-28 03:46:12,161 INFO L591 BuchiCegarLoop]: Abstraction has 33096 states and 52188 transitions. [2019-11-28 03:46:12,161 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 03:46:12,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33096 states and 52188 transitions. [2019-11-28 03:46:12,243 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 13770 [2019-11-28 03:46:12,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:12,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:12,244 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:12,244 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:12,244 INFO L794 eck$LassoCheckResult]: Stem: 173685#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 173452#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 173453#L394 assume !(1 == ~c_req_up~0); 173455#L394-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173631#L405-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173669#L410-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173670#L415-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173742#L420-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173507#L425-1 assume !(0 == ~e_f~0); 173508#L430-1 assume !(0 == ~e_g~0); 173651#L435-1 assume !(0 == ~e_e~0); 173652#L440-1 assume !(0 == ~e_c~0); 173741#L445-1 assume !(0 == ~e_wl~0); 173740#L450-1 assume !(1 == ~wl_pc~0); 173694#L462 assume !(2 == ~wl_pc~0); 173463#L463 assume !(1 == ~c1_pc~0); 173635#L473 assume !(1 == ~c2_pc~0); 173734#L482 assume !(1 == ~wb_pc~0); 173569#L491 assume !(1 == ~e_c~0); 173570#L500-1 assume !(1 == ~e_e~0); 173725#L505-1 assume !(1 == ~e_f~0); 173580#L510-1 assume !(1 == ~e_g~0); 173581#L515-1 assume !(1 == ~e_c~0); 173640#L520-1 assume !(1 == ~e_wl~0); 173686#L662-1 assume !false; 180618#L532 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 180620#L367 [2019-11-28 03:46:12,244 INFO L796 eck$LassoCheckResult]: Loop: 180620#L367 assume !false; 180973#L285 assume 0 == ~wl_st~0; 180971#L298-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 180970#L311 assume !(0 != eval_~tmp~0); 180969#L307 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 180958#L326 assume !(0 != eval_~tmp___0~0); 180968#L322 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 180864#L341 assume !(0 != eval_~tmp___1~0); 180627#L337 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 180623#L356 assume !(0 != eval_~tmp___2~0); 180625#L352 assume !(0 == ~r_st~0); 180620#L367 [2019-11-28 03:46:12,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:12,245 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-11-28 03:46:12,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:12,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131978929] [2019-11-28 03:46:12,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:12,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:12,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1611757493, now seen corresponding path program 1 times [2019-11-28 03:46:12,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:12,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21465879] [2019-11-28 03:46:12,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:12,268 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1159673533, now seen corresponding path program 1 times [2019-11-28 03:46:12,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:12,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108623444] [2019-11-28 03:46:12,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:12,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:12,769 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-11-28 03:46:12,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:46:12 BoogieIcfgContainer [2019-11-28 03:46:12,874 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:46:12,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:46:12,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:46:12,875 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:46:12,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:46:01" (3/4) ... [2019-11-28 03:46:12,879 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:46:12,935 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:46:12,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:46:12,937 INFO L168 Benchmark]: Toolchain (without parser) took 12442.24 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 467.1 MB). Free memory was 960.4 MB in the beginning and 973.8 MB in the end (delta: -13.5 MB). Peak memory consumption was 453.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:12,937 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:46:12,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:12,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:46:12,938 INFO L168 Benchmark]: Boogie Preprocessor took 36.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:12,939 INFO L168 Benchmark]: RCFGBuilder took 783.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:12,939 INFO L168 Benchmark]: BuchiAutomizer took 11028.97 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.1 GB in the beginning and 973.8 MB in the end (delta: 81.5 MB). Peak memory consumption was 435.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:12,939 INFO L168 Benchmark]: Witness Printer took 60.78 ms. Allocated memory is still 1.5 GB. Free memory is still 973.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:46:12,942 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 466.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 783.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11028.97 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.4 MB). Free memory was 1.1 GB in the beginning and 973.8 MB in the end (delta: 81.5 MB). Peak memory consumption was 435.9 MB. Max. memory is 11.5 GB. * Witness Printer took 60.78 ms. Allocated memory is still 1.5 GB. Free memory is still 973.8 MB. There was no memory consumed. 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 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 33096 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 16 iterations. TraceHistogramMax:2. Analysis of lassos took 4.8s. Construction of modules took 0.5s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 2.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 471 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 1.2s Buchi closure took 0.0s. Biggest automaton had 33096 states and ocurred in iteration 15. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 4076 SDtfs, 3647 SDslu, 2145 SDs, 0 SdLazy, 375 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc2 concLT1 SILN1 SILU0 SILI8 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital84 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf100 smp100 dnf211 smp50 tf111 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 284]: 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 {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7331f255=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23805aae=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42b9de14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@634dadf9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cfb565e=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 284]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) [L455] COND FALSE !((int )wl_pc == 1) [L463] COND FALSE !((int )wl_pc == 2) [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; Loop: [L284] COND TRUE 1 [L286] COND TRUE (int )wl_st == 0 [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND FALSE !(\read(tmp)) [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND FALSE !(\read(tmp___0)) [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND FALSE !(\read(tmp___1)) [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND FALSE !(\read(tmp___2)) [L367] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...