./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-15 23:46:11,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:46:11,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:46:11,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:46:11,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:46:11,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:46:11,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:46:11,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:46:11,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:46:11,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:46:11,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:46:11,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:46:11,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:46:11,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:46:11,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:46:11,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:46:11,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:46:11,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:46:11,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:46:11,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:46:11,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:46:11,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:46:11,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:46:11,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:46:11,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:46:11,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:46:11,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:46:11,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:46:11,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:46:11,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:46:11,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:46:11,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:46:11,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:46:11,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:46:11,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:46:11,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:46:11,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:46:11,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:46:11,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:46:11,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:46:11,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:46:11,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:46:12,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:46:12,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:46:12,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:46:12,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:46:12,019 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:46:12,020 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:46:12,020 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:46:12,020 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:46:12,020 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:46:12,021 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:46:12,021 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:46:12,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:46:12,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:46:12,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:46:12,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:46:12,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:46:12,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:46:12,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:46:12,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:46:12,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:46:12,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:46:12,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:46:12,025 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:46:12,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:46:12,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:46:12,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:46:12,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:46:12,026 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:46:12,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:46:12,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:46:12,027 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:46:12,028 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:46:12,030 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 [2019-11-15 23:46:12,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:46:12,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:46:12,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:46:12,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:46:12,079 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:46:12,079 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/../../sv-benchmarks/c/systemc/toy1.cil.c [2019-11-15 23:46:12,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/data/08b0ed1c4/7b487070d9074401b548decc8c77ce03/FLAGfe2539a5e [2019-11-15 23:46:12,578 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:46:12,595 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/sv-benchmarks/c/systemc/toy1.cil.c [2019-11-15 23:46:12,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/data/08b0ed1c4/7b487070d9074401b548decc8c77ce03/FLAGfe2539a5e [2019-11-15 23:46:12,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/data/08b0ed1c4/7b487070d9074401b548decc8c77ce03 [2019-11-15 23:46:12,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:46:12,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:46:12,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:12,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:46:12,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:46:12,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:12" (1/1) ... [2019-11-15 23:46:12,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@250ff41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:12, skipping insertion in model container [2019-11-15 23:46:12,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:12" (1/1) ... [2019-11-15 23:46:12,959 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:46:13,000 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:46:13,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:13,283 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:46:13,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:13,348 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:46:13,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13 WrapperNode [2019-11-15 23:46:13,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:13,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:46:13,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:46:13,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:46:13,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:46:13,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:46:13,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:46:13,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:46:13,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... [2019-11-15 23:46:13,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:46:13,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:46:13,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:46:13,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:46:13,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:46:13,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:46:14,227 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:46:14,227 INFO L284 CfgBuilder]: Removed 28 assume(true) statements. [2019-11-15 23:46:14,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:14 BoogieIcfgContainer [2019-11-15 23:46:14,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:46:14,229 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:46:14,229 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:46:14,233 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:46:14,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:46:14,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:46:12" (1/3) ... [2019-11-15 23:46:14,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2add282d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:46:14, skipping insertion in model container [2019-11-15 23:46:14,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:46:14,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:13" (2/3) ... [2019-11-15 23:46:14,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2add282d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:46:14, skipping insertion in model container [2019-11-15 23:46:14,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:46:14,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:14" (3/3) ... [2019-11-15 23:46:14,242 INFO L371 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2019-11-15 23:46:14,305 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:46:14,306 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:46:14,306 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:46:14,309 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:46:14,309 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:46:14,309 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:46:14,309 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:46:14,310 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:46:14,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2019-11-15 23:46:14,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-11-15 23:46:14,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:14,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:14,404 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-15 23:46:14,404 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-15 23:46:14,404 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:46:14,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2019-11-15 23:46:14,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-11-15 23:46:14,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:14,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:14,427 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-15 23:46:14,427 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-15 23:46:14,435 INFO L791 eck$LassoCheckResult]: Stem: 91#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; 15#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; 29#L406true assume !(1 == ~c_req_up~0); 16#L406-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 31#L417-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 49#L422-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 72#L427-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 93#L432-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 106#L437-1true assume !(0 == ~e_f~0); 3#L442-1true assume !(0 == ~e_g~0); 33#L447-1true assume !(0 == ~e_e~0); 54#L452-1true assume !(0 == ~e_c~0); 77#L457-1true assume !(0 == ~e_wl~0); 97#L462-1true assume !(1 == ~wl_pc~0); 67#L474true assume !(2 == ~wl_pc~0); 21#L475true assume !(1 == ~c1_pc~0); 65#L485true assume !(1 == ~c2_pc~0); 24#L494true assume !(1 == ~wb_pc~0); 118#L503true assume !(1 == ~e_c~0); 90#L512-1true assume !(1 == ~e_e~0); 94#L517-1true assume !(1 == ~e_f~0); 122#L522-1true assume !(1 == ~e_g~0); 25#L527-1true assume !(1 == ~e_c~0); 46#L532-1true assume !(1 == ~e_wl~0); 101#L674-1true [2019-11-15 23:46:14,436 INFO L793 eck$LassoCheckResult]: Loop: 101#L674-1true assume !false; 10#L544true 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; 126#L379true assume !true; 30#L395true start_simulation_~kernel_st~0 := 2; 112#L550true assume !(1 == ~c_req_up~0); 95#L550-2true start_simulation_~kernel_st~0 := 3; 62#L562true assume 0 == ~e_f~0;~e_f~0 := 1; 64#L562-2true assume 0 == ~e_g~0;~e_g~0 := 1; 87#L567-1true assume 0 == ~e_e~0;~e_e~0 := 1; 114#L572-1true assume !(0 == ~e_c~0); 11#L577-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 41#L582-1true assume 1 == ~wl_pc~0; 8#L588true assume 1 == ~e_wl~0;~wl_st~0 := 0; 61#L595true assume !(1 == ~c1_pc~0); 108#L605true assume !(1 == ~c2_pc~0); 80#L614true assume !(1 == ~wb_pc~0); 51#L623true assume 1 == ~e_c~0;~r_st~0 := 0; 6#L632-1true assume 1 == ~e_e~0;~e_e~0 := 2; 38#L637-1true assume 1 == ~e_f~0;~e_f~0 := 2; 58#L642-1true assume 1 == ~e_g~0;~e_g~0 := 2; 81#L647-1true assume !(1 == ~e_c~0); 103#L652-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 129#L657-1true assume 0 == ~wl_st~0; 101#L674-1true [2019-11-15 23:46:14,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-11-15 23:46:14,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25928170] [2019-11-15 23:46:14,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,610 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-15 23:46:14,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25928170] [2019-11-15 23:46:14,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:14,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:14,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034919200] [2019-11-15 23:46:14,616 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash 476885301, now seen corresponding path program 1 times [2019-11-15 23:46:14,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669629601] [2019-11-15 23:46:14,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,627 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-15 23:46:14,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669629601] [2019-11-15 23:46:14,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:14,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:46:14,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242515698] [2019-11-15 23:46:14,630 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:46:14,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:14,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:46:14,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:46:14,647 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2019-11-15 23:46:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:14,661 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2019-11-15 23:46:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:46:14,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2019-11-15 23:46:14,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:14,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2019-11-15 23:46:14,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-11-15 23:46:14,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-11-15 23:46:14,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2019-11-15 23:46:14,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:46:14,677 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-11-15 23:46:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2019-11-15 23:46:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-15 23:46:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:46:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2019-11-15 23:46:14,713 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-11-15 23:46:14,713 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-11-15 23:46:14,713 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:46:14,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2019-11-15 23:46:14,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:14,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:14,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:14,717 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-15 23:46:14,717 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-15 23:46:14,717 INFO L791 eck$LassoCheckResult]: Stem: 375#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; 292#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; 293#L406 assume !(1 == ~c_req_up~0); 294#L406-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 295#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 318#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 341#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 363#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 376#L437-1 assume !(0 == ~e_f~0); 263#L442-1 assume !(0 == ~e_g~0); 264#L447-1 assume !(0 == ~e_e~0); 321#L452-1 assume !(0 == ~e_c~0); 346#L457-1 assume !(0 == ~e_wl~0); 366#L462-1 assume !(1 == ~wl_pc~0); 360#L474 assume !(2 == ~wl_pc~0); 303#L475 assume !(1 == ~c1_pc~0); 299#L485 assume !(1 == ~c2_pc~0); 308#L494 assume !(1 == ~wb_pc~0); 309#L503 assume !(1 == ~e_c~0); 373#L512-1 assume !(1 == ~e_e~0); 374#L517-1 assume !(1 == ~e_f~0); 377#L522-1 assume !(1 == ~e_g~0); 311#L527-1 assume !(1 == ~e_c~0); 312#L532-1 assume !(1 == ~e_wl~0); 267#L674-1 [2019-11-15 23:46:14,718 INFO L793 eck$LassoCheckResult]: Loop: 267#L674-1 assume !false; 281#L544 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; 282#L379 assume !false; 372#L297 assume !(0 == ~wl_st~0); 340#L301 assume !(0 == ~c1_st~0); 331#L304 assume !(0 == ~c2_st~0); 297#L307 assume !(0 == ~wb_st~0); 278#L310 assume !(0 == ~r_st~0); 280#L395 start_simulation_~kernel_st~0 := 2; 317#L550 assume !(1 == ~c_req_up~0); 359#L550-2 start_simulation_~kernel_st~0 := 3; 353#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 354#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 357#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 371#L572-1 assume !(0 == ~e_c~0); 283#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 284#L582-1 assume 1 == ~wl_pc~0; 275#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 276#L595 assume !(1 == ~c1_pc~0); 352#L605 assume !(1 == ~c2_pc~0); 327#L614 assume !(1 == ~wb_pc~0); 344#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 270#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 271#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 328#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 350#L647-1 assume !(1 == ~e_c~0); 368#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 380#L657-1 assume 0 == ~wl_st~0; 267#L674-1 [2019-11-15 23:46:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-11-15 23:46:14,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81582636] [2019-11-15 23:46:14,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,771 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-15 23:46:14,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81582636] [2019-11-15 23:46:14,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:14,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:14,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609373959] [2019-11-15 23:46:14,773 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 1 times [2019-11-15 23:46:14,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161814484] [2019-11-15 23:46:14,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,814 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-15 23:46:14,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161814484] [2019-11-15 23:46:14,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:14,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:14,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192237235] [2019-11-15 23:46:14,816 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:46:14,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:14,817 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand 3 states. [2019-11-15 23:46:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:14,840 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2019-11-15 23:46:14,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:14,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2019-11-15 23:46:14,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:14,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2019-11-15 23:46:14,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-11-15 23:46:14,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-11-15 23:46:14,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2019-11-15 23:46:14,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:46:14,849 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-11-15 23:46:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2019-11-15 23:46:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-15 23:46:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:46:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2019-11-15 23:46:14,859 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-11-15 23:46:14,859 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-11-15 23:46:14,859 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:46:14,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2019-11-15 23:46:14,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:14,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:14,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:14,863 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-15 23:46:14,863 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-15 23:46:14,864 INFO L791 eck$LassoCheckResult]: Stem: 624#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; 541#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; 542#L406 assume !(1 == ~c_req_up~0); 543#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 544#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 567#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 590#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 612#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 625#L437-1 assume !(0 == ~e_f~0); 512#L442-1 assume !(0 == ~e_g~0); 513#L447-1 assume !(0 == ~e_e~0); 570#L452-1 assume !(0 == ~e_c~0); 595#L457-1 assume !(0 == ~e_wl~0); 615#L462-1 assume !(1 == ~wl_pc~0); 609#L474 assume !(2 == ~wl_pc~0); 552#L475 assume !(1 == ~c1_pc~0); 548#L485 assume !(1 == ~c2_pc~0); 557#L494 assume !(1 == ~wb_pc~0); 558#L503 assume !(1 == ~e_c~0); 622#L512-1 assume !(1 == ~e_e~0); 623#L517-1 assume !(1 == ~e_f~0); 626#L522-1 assume !(1 == ~e_g~0); 560#L527-1 assume !(1 == ~e_c~0); 561#L532-1 assume !(1 == ~e_wl~0); 516#L674-1 [2019-11-15 23:46:14,864 INFO L793 eck$LassoCheckResult]: Loop: 516#L674-1 assume !false; 530#L544 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; 531#L379 assume !false; 621#L297 assume !(0 == ~wl_st~0); 589#L301 assume !(0 == ~c1_st~0); 580#L304 assume !(0 == ~c2_st~0); 546#L307 assume !(0 == ~wb_st~0); 527#L310 assume !(0 == ~r_st~0); 529#L395 start_simulation_~kernel_st~0 := 2; 566#L550 assume !(1 == ~c_req_up~0); 608#L550-2 start_simulation_~kernel_st~0 := 3; 602#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 603#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 606#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 620#L572-1 assume !(0 == ~e_c~0); 532#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 533#L582-1 assume 1 == ~wl_pc~0; 524#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 525#L595 assume !(1 == ~c1_pc~0); 601#L605 assume !(1 == ~c2_pc~0); 576#L614 assume !(1 == ~wb_pc~0); 593#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 519#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 520#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 577#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 599#L647-1 assume !(1 == ~e_c~0); 617#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 629#L657-1 assume 0 == ~wl_st~0; 516#L674-1 [2019-11-15 23:46:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-11-15 23:46:14,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984757022] [2019-11-15 23:46:14,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,923 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-15 23:46:14,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984757022] [2019-11-15 23:46:14,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:14,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:14,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004485836] [2019-11-15 23:46:14,925 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,925 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 2 times [2019-11-15 23:46:14,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346458626] [2019-11-15 23:46:14,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:14,960 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-15 23:46:14,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346458626] [2019-11-15 23:46:14,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:14,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:14,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18810595] [2019-11-15 23:46:14,961 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:46:14,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:14,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:14,962 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-11-15 23:46:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:14,973 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2019-11-15 23:46:14,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:14,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 213 transitions. [2019-11-15 23:46:14,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:14,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 213 transitions. [2019-11-15 23:46:14,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-11-15 23:46:14,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-11-15 23:46:14,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 213 transitions. [2019-11-15 23:46:14,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:46:14,979 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-11-15 23:46:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 213 transitions. [2019-11-15 23:46:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-15 23:46:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:46:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2019-11-15 23:46:14,986 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-11-15 23:46:14,986 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-11-15 23:46:14,986 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:46:14,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 213 transitions. [2019-11-15 23:46:14,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:14,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:14,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:14,989 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-15 23:46:14,989 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-15 23:46:14,989 INFO L791 eck$LassoCheckResult]: Stem: 873#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; 790#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; 791#L406 assume !(1 == ~c_req_up~0); 792#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 793#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 816#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 839#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 861#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 874#L437-1 assume !(0 == ~e_f~0); 761#L442-1 assume !(0 == ~e_g~0); 762#L447-1 assume !(0 == ~e_e~0); 819#L452-1 assume !(0 == ~e_c~0); 844#L457-1 assume !(0 == ~e_wl~0); 864#L462-1 assume !(1 == ~wl_pc~0); 858#L474 assume !(2 == ~wl_pc~0); 801#L475 assume !(1 == ~c1_pc~0); 797#L485 assume !(1 == ~c2_pc~0); 806#L494 assume !(1 == ~wb_pc~0); 807#L503 assume !(1 == ~e_c~0); 871#L512-1 assume !(1 == ~e_e~0); 872#L517-1 assume !(1 == ~e_f~0); 875#L522-1 assume !(1 == ~e_g~0); 809#L527-1 assume !(1 == ~e_c~0); 810#L532-1 assume !(1 == ~e_wl~0); 765#L674-1 [2019-11-15 23:46:14,990 INFO L793 eck$LassoCheckResult]: Loop: 765#L674-1 assume !false; 779#L544 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; 780#L379 assume !false; 870#L297 assume !(0 == ~wl_st~0); 838#L301 assume !(0 == ~c1_st~0); 829#L304 assume !(0 == ~c2_st~0); 795#L307 assume !(0 == ~wb_st~0); 776#L310 assume !(0 == ~r_st~0); 778#L395 start_simulation_~kernel_st~0 := 2; 815#L550 assume !(1 == ~c_req_up~0); 857#L550-2 start_simulation_~kernel_st~0 := 3; 851#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 852#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 855#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 869#L572-1 assume !(0 == ~e_c~0); 781#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L582-1 assume 1 == ~wl_pc~0; 773#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 774#L595 assume !(1 == ~c1_pc~0); 850#L605 assume !(1 == ~c2_pc~0); 825#L614 assume !(1 == ~wb_pc~0); 842#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 768#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 769#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 826#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 848#L647-1 assume !(1 == ~e_c~0); 866#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 878#L657-1 assume 0 == ~wl_st~0; 765#L674-1 [2019-11-15 23:46:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-11-15 23:46:14,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:14,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090919221] [2019-11-15 23:46:14,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:14,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:15,015 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-15 23:46:15,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090919221] [2019-11-15 23:46:15,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:15,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:15,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187063539] [2019-11-15 23:46:15,017 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 3 times [2019-11-15 23:46:15,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:15,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864730922] [2019-11-15 23:46:15,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:15,036 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-15 23:46:15,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864730922] [2019-11-15 23:46:15,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:15,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:15,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284865469] [2019-11-15 23:46:15,037 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:46:15,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:15,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:15,038 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-11-15 23:46:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:15,054 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2019-11-15 23:46:15,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:15,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 212 transitions. [2019-11-15 23:46:15,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:15,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 212 transitions. [2019-11-15 23:46:15,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-11-15 23:46:15,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-11-15 23:46:15,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 212 transitions. [2019-11-15 23:46:15,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:46:15,060 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-11-15 23:46:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 212 transitions. [2019-11-15 23:46:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-15 23:46:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:46:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2019-11-15 23:46:15,076 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-11-15 23:46:15,077 INFO L591 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-11-15 23:46:15,077 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:46:15,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 212 transitions. [2019-11-15 23:46:15,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-15 23:46:15,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:15,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:15,079 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-15 23:46:15,079 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-15 23:46:15,080 INFO L791 eck$LassoCheckResult]: Stem: 1122#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; 1039#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; 1040#L406 assume !(1 == ~c_req_up~0); 1041#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1042#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1065#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1088#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1110#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1123#L437-1 assume !(0 == ~e_f~0); 1010#L442-1 assume !(0 == ~e_g~0); 1011#L447-1 assume !(0 == ~e_e~0); 1068#L452-1 assume !(0 == ~e_c~0); 1093#L457-1 assume !(0 == ~e_wl~0); 1113#L462-1 assume !(1 == ~wl_pc~0); 1107#L474 assume !(2 == ~wl_pc~0); 1050#L475 assume !(1 == ~c1_pc~0); 1046#L485 assume !(1 == ~c2_pc~0); 1055#L494 assume !(1 == ~wb_pc~0); 1056#L503 assume !(1 == ~e_c~0); 1120#L512-1 assume !(1 == ~e_e~0); 1121#L517-1 assume !(1 == ~e_f~0); 1124#L522-1 assume !(1 == ~e_g~0); 1058#L527-1 assume !(1 == ~e_c~0); 1059#L532-1 assume !(1 == ~e_wl~0); 1014#L674-1 [2019-11-15 23:46:15,080 INFO L793 eck$LassoCheckResult]: Loop: 1014#L674-1 assume !false; 1028#L544 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; 1029#L379 assume !false; 1119#L297 assume !(0 == ~wl_st~0); 1087#L301 assume !(0 == ~c1_st~0); 1078#L304 assume !(0 == ~c2_st~0); 1044#L307 assume !(0 == ~wb_st~0); 1025#L310 assume !(0 == ~r_st~0); 1027#L395 start_simulation_~kernel_st~0 := 2; 1064#L550 assume !(1 == ~c_req_up~0); 1106#L550-2 start_simulation_~kernel_st~0 := 3; 1100#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1101#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1104#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1118#L572-1 assume !(0 == ~e_c~0); 1030#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1031#L582-1 assume !(1 == ~wl_pc~0); 1024#L594 assume !(2 == ~wl_pc~0); 1023#L595 assume !(1 == ~c1_pc~0); 1099#L605 assume !(1 == ~c2_pc~0); 1074#L614 assume !(1 == ~wb_pc~0); 1091#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1017#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1018#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1075#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1097#L647-1 assume !(1 == ~e_c~0); 1115#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1127#L657-1 assume 0 == ~wl_st~0; 1014#L674-1 [2019-11-15 23:46:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-11-15 23:46:15,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:15,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925122371] [2019-11-15 23:46:15,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:15,146 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 1 times [2019-11-15 23:46:15,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:15,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377774378] [2019-11-15 23:46:15,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:15,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377774378] [2019-11-15 23:46:15,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:15,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:15,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456950448] [2019-11-15 23:46:15,180 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:46:15,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:15,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:15,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:15,180 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-11-15 23:46:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:15,234 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2019-11-15 23:46:15,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:15,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 272 transitions. [2019-11-15 23:46:15,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-15 23:46:15,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 272 transitions. [2019-11-15 23:46:15,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2019-11-15 23:46:15,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2019-11-15 23:46:15,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 272 transitions. [2019-11-15 23:46:15,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:46:15,248 INFO L688 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-11-15 23:46:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 272 transitions. [2019-11-15 23:46:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-15 23:46:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-15 23:46:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 272 transitions. [2019-11-15 23:46:15,260 INFO L711 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-11-15 23:46:15,261 INFO L591 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-11-15 23:46:15,261 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:46:15,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 272 transitions. [2019-11-15 23:46:15,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-15 23:46:15,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:15,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:15,263 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-15 23:46:15,263 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-15 23:46:15,264 INFO L791 eck$LassoCheckResult]: Stem: 1406#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; 1319#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; 1320#L406 assume !(1 == ~c_req_up~0); 1321#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1322#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1345#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1369#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1393#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1407#L437-1 assume !(0 == ~e_f~0); 1293#L442-1 assume !(0 == ~e_g~0); 1294#L447-1 assume !(0 == ~e_e~0); 1348#L452-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1375#L457-1 assume !(0 == ~e_wl~0); 1396#L462-1 assume !(1 == ~wl_pc~0); 1390#L474 assume !(2 == ~wl_pc~0); 1330#L475 assume !(1 == ~c1_pc~0); 1326#L485 assume !(1 == ~c2_pc~0); 1335#L494 assume !(1 == ~wb_pc~0); 1336#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 1416#L512-1 assume !(1 == ~e_e~0); 1408#L517-1 assume !(1 == ~e_f~0); 1409#L522-1 assume !(1 == ~e_g~0); 1338#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1339#L532-1 assume !(1 == ~e_wl~0); 1292#L674-1 [2019-11-15 23:46:15,264 INFO L793 eck$LassoCheckResult]: Loop: 1292#L674-1 assume !false; 1308#L544 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; 1309#L379 assume !false; 1403#L297 assume !(0 == ~wl_st~0); 1368#L301 assume !(0 == ~c1_st~0); 1359#L304 assume !(0 == ~c2_st~0); 1324#L307 assume !(0 == ~wb_st~0); 1305#L310 assume !(0 == ~r_st~0); 1307#L395 start_simulation_~kernel_st~0 := 2; 1344#L550 assume !(1 == ~c_req_up~0); 1389#L550-2 start_simulation_~kernel_st~0 := 3; 1383#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1384#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1387#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1402#L572-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1415#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1442#L582-1 assume 1 == ~wl_pc~0; 1440#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1438#L595 assume !(1 == ~c1_pc~0); 1436#L605 assume !(1 == ~c2_pc~0); 1398#L614 assume !(1 == ~wb_pc~0); 1372#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1373#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1355#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1356#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1378#L647-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1397#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1412#L657-1 assume 0 == ~wl_st~0; 1292#L674-1 [2019-11-15 23:46:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:15,264 INFO L82 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2019-11-15 23:46:15,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:15,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547018450] [2019-11-15 23:46:15,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:15,296 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-15 23:46:15,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547018450] [2019-11-15 23:46:15,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:15,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:15,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694578726] [2019-11-15 23:46:15,298 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1254823475, now seen corresponding path program 1 times [2019-11-15 23:46:15,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:15,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270359051] [2019-11-15 23:46:15,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:15,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:15,311 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:15,434 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 23:46:15,534 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:46:15,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:46:15,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:46:15,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:46:15,536 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:46:15,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:15,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:46:15,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:46:15,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2019-11-15 23:46:15,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:46:15,537 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:46:15,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-15 23:46:15,565 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-15 23:46:15,572 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-15 23:46:15,574 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-15 23:46:15,578 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-15 23:46:15,583 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-15 23:46:15,592 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-15 23:46:15,596 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-15 23:46:15,600 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-15 23:46:15,602 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-15 23:46:15,604 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-15 23:46:15,610 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-15 23:46:15,613 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-15 23:46:15,622 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-15 23:46:15,625 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-15 23:46:15,634 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-15 23:46:15,638 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-15 23:46:15,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-15 23:46:15,646 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-15 23:46:15,648 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-15 23:46:15,660 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-15 23:46:15,662 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-15 23:46:15,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-15 23:46:15,669 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-15 23:46:15,676 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-15 23:46:15,679 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-15 23:46:16,009 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:16,013 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:46:16,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:16,021 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:16,031 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:16,031 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 /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:16,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:16,046 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 /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:46:16,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:46:16,075 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:16,086 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:46:16,088 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:46:16,089 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:46:16,089 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:46:16,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:46:16,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:46:16,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:16,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:46:16,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:46:16,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration6_Loop [2019-11-15 23:46:16,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:46:16,090 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:46:16,093 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-15 23:46:16,098 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-15 23:46:16,104 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-15 23:46:16,107 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-15 23:46:16,110 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-15 23:46:16,113 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-15 23:46:16,120 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-15 23:46:16,123 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-15 23:46:16,126 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-15 23:46:16,129 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-15 23:46:16,131 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-15 23:46:16,137 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-15 23:46:16,139 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-15 23:46:16,142 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-15 23:46:16,145 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-15 23:46:16,158 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-15 23:46:16,161 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-15 23:46:16,167 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-15 23:46:16,169 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-15 23:46:16,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-15 23:46:16,178 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-15 23:46:16,180 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-15 23:46:16,183 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-15 23:46:16,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-15 23:46:16,190 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-15 23:46:16,192 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-15 23:46:16,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:16,473 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:46:16,475 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-15 23:46:16,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:16,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:16,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:16,478 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:46:16,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:16,480 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:46:16,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:16,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:16,486 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-15 23:46:16,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:16,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:16,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:16,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:16,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:16,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:16,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:16,493 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:46:16,496 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:46:16,496 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:46:16,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:46:16,498 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:46:16,498 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:46:16,499 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-11-15 23:46:16,502 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:46:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:16,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:16,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:16,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:46:16,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:16,694 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-15 23:46:16,698 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-15 23:46:16,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120 Second operand 5 states. [2019-11-15 23:46:16,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 474 states and 835 transitions. Complement of second has 5 states. [2019-11-15 23:46:16,805 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-15 23:46:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:46:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2019-11-15 23:46:16,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2019-11-15 23:46:16,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:16,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2019-11-15 23:46:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2019-11-15 23:46:16,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:16,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 835 transitions. [2019-11-15 23:46:16,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 302 [2019-11-15 23:46:16,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 459 states and 805 transitions. [2019-11-15 23:46:16,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2019-11-15 23:46:16,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2019-11-15 23:46:16,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 805 transitions. [2019-11-15 23:46:16,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:16,822 INFO L688 BuchiCegarLoop]: Abstraction has 459 states and 805 transitions. [2019-11-15 23:46:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 805 transitions. [2019-11-15 23:46:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 351. [2019-11-15 23:46:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-15 23:46:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 616 transitions. [2019-11-15 23:46:16,840 INFO L711 BuchiCegarLoop]: Abstraction has 351 states and 616 transitions. [2019-11-15 23:46:16,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:16,840 INFO L87 Difference]: Start difference. First operand 351 states and 616 transitions. Second operand 4 states. [2019-11-15 23:46:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:16,957 INFO L93 Difference]: Finished difference Result 640 states and 1104 transitions. [2019-11-15 23:46:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:46:16,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 1104 transitions. [2019-11-15 23:46:16,963 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2019-11-15 23:46:16,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 640 states and 1104 transitions. [2019-11-15 23:46:16,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2019-11-15 23:46:16,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2019-11-15 23:46:16,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 1104 transitions. [2019-11-15 23:46:16,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:16,971 INFO L688 BuchiCegarLoop]: Abstraction has 640 states and 1104 transitions. [2019-11-15 23:46:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 1104 transitions. [2019-11-15 23:46:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 610. [2019-11-15 23:46:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-15 23:46:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1062 transitions. [2019-11-15 23:46:16,990 INFO L711 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2019-11-15 23:46:16,990 INFO L591 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2019-11-15 23:46:16,991 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:46:16,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 1062 transitions. [2019-11-15 23:46:16,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2019-11-15 23:46:16,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:16,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:16,995 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-15 23:46:16,996 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-15 23:46:16,996 INFO L791 eck$LassoCheckResult]: Stem: 3323#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; 3145#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; 3146#L406 assume !(1 == ~c_req_up~0); 3147#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3148#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3189#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3379#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3324#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3325#L437-1 assume !(0 == ~e_f~0); 3088#L442-1 assume !(0 == ~e_g~0); 3089#L447-1 assume !(0 == ~e_e~0); 3194#L452-1 assume !(0 == ~e_c~0); 3255#L457-1 assume !(0 == ~e_wl~0); 3373#L462-1 assume !(1 == ~wl_pc~0); 3371#L474 assume !(2 == ~wl_pc~0); 3370#L475 assume !(1 == ~c1_pc~0); 3411#L485 assume !(1 == ~c2_pc~0); 3409#L494 assume !(1 == ~wb_pc~0); 3407#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 3321#L512-1 assume !(1 == ~e_e~0); 3322#L517-1 assume !(1 == ~e_f~0); 3326#L522-1 assume !(1 == ~e_g~0); 3176#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3177#L532-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3092#L674-1 [2019-11-15 23:46:16,996 INFO L793 eck$LassoCheckResult]: Loop: 3092#L674-1 assume !false; 3336#L544 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; 3646#L379 assume !false; 3645#L297 assume !(0 == ~wl_st~0); 3644#L301 assume !(0 == ~c1_st~0); 3214#L304 assume !(0 == ~c2_st~0); 3151#L307 assume !(0 == ~wb_st~0); 3153#L310 assume !(0 == ~r_st~0); 3639#L395 start_simulation_~kernel_st~0 := 2; 3637#L550 assume !(1 == ~c_req_up~0); 3327#L550-2 start_simulation_~kernel_st~0 := 3; 3328#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 3283#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3284#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3315#L572-1 assume !(0 == ~e_c~0); 3492#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3491#L582-1 assume 1 == ~wl_pc~0; 3489#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3488#L595 assume !(1 == ~c1_pc~0); 3481#L605 assume !(1 == ~c2_pc~0); 3475#L614 assume !(1 == ~wb_pc~0); 3471#L623 assume !(1 == ~e_c~0); 3468#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3465#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3462#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3459#L647-1 assume !(1 == ~e_c~0); 3306#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3356#L657-1 assume 0 == ~wl_st~0; 3092#L674-1 [2019-11-15 23:46:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 198346713, now seen corresponding path program 1 times [2019-11-15 23:46:16,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:16,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750999433] [2019-11-15 23:46:16,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:16,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:16,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:17,082 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-15 23:46:17,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750999433] [2019-11-15 23:46:17,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:17,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:17,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266180652] [2019-11-15 23:46:17,083 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2018715509, now seen corresponding path program 1 times [2019-11-15 23:46:17,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:17,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136810184] [2019-11-15 23:46:17,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:17,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:17,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:17,104 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:17,260 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:46:17,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:46:17,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:46:17,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:46:17,260 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:46:17,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:17,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:46:17,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:46:17,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2019-11-15 23:46:17,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:46:17,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:46:17,263 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-15 23:46:17,267 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-15 23:46:17,273 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-15 23:46:17,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-15 23:46:17,278 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-15 23:46:17,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-15 23:46:17,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-15 23:46:17,290 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-15 23:46:17,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-15 23:46:17,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-15 23:46:17,304 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-15 23:46:17,307 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-15 23:46:17,318 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-15 23:46:17,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-15 23:46:17,331 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-15 23:46:17,334 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-15 23:46:17,337 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-15 23:46:17,340 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-15 23:46:17,342 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-15 23:46:17,344 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-15 23:46:17,347 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-15 23:46:17,348 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-15 23:46:17,350 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-15 23:46:17,353 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-15 23:46:17,355 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-15 23:46:17,361 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-15 23:46:17,613 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:17,613 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:17,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:17,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:17,631 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:17,631 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 /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:17,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:17,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:17,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:17,665 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 /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:17,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:17,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:17,737 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:17,737 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 /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:46:17,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:17,750 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:17,762 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:17,763 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:46:17,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:17,772 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:17,778 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:17,778 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:17,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:17,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:17,788 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:17,788 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:17,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:17,794 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:17,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:46:17,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:17,806 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:46:17,807 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:46:17,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:46:17,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:46:17,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:46:17,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:46:17,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:17,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:46:17,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:46:17,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2019-11-15 23:46:17,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:46:17,808 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:46:17,811 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-15 23:46:17,813 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-15 23:46:17,815 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-15 23:46:17,820 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-15 23:46:17,823 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-15 23:46:17,826 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-15 23:46:17,829 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-15 23:46:17,837 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-15 23:46:17,842 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-15 23:46:17,844 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-15 23:46:17,849 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-15 23:46:17,852 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-15 23:46:17,857 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-15 23:46:17,863 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-15 23:46:17,865 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-15 23:46:17,870 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-15 23:46:17,873 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-15 23:46:17,876 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-15 23:46:17,879 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-15 23:46:17,881 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-15 23:46:17,887 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-15 23:46:17,889 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-15 23:46:17,890 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-15 23:46:17,892 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-15 23:46:17,893 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-15 23:46:17,895 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-15 23:46:18,154 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:18,154 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:46:18,154 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-15 23:46:18,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:18,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:18,156 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:18,158 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-15 23:46:18,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,158 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,158 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:46:18,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,159 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:46:18,159 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:18,161 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-15 23:46:18,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,162 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:46:18,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,163 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:46:18,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:18,164 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-15 23:46:18,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:18,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,166 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:18,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:18,168 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-15 23:46:18,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,169 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:46:18,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,170 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:46:18,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:18,171 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-15 23:46:18,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,172 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:46:18,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,173 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:46:18,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:18,174 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-15 23:46:18,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:18,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:18,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:18,177 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-15 23:46:18,178 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:18,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:18,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:18,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:18,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:18,179 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:18,179 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:18,182 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:46:18,184 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:46:18,184 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:46:18,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:46:18,184 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:46:18,185 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:46:18,185 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2019-11-15 23:46:18,185 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:46:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:18,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:18,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:18,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:46:18,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:18,263 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-15 23:46:18,263 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-15 23:46:18,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458 Second operand 5 states. [2019-11-15 23:46:18,322 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458. Second operand 5 states. Result 1027 states and 1790 transitions. Complement of second has 5 states. [2019-11-15 23:46:18,323 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-15 23:46:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:46:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2019-11-15 23:46:18,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 28 letters. [2019-11-15 23:46:18,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:18,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 52 letters. Loop has 28 letters. [2019-11-15 23:46:18,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:18,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 56 letters. [2019-11-15 23:46:18,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:18,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1027 states and 1790 transitions. [2019-11-15 23:46:18,343 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 573 [2019-11-15 23:46:18,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1027 states to 1021 states and 1780 transitions. [2019-11-15 23:46:18,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 657 [2019-11-15 23:46:18,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 663 [2019-11-15 23:46:18,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1021 states and 1780 transitions. [2019-11-15 23:46:18,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:18,356 INFO L688 BuchiCegarLoop]: Abstraction has 1021 states and 1780 transitions. [2019-11-15 23:46:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states and 1780 transitions. [2019-11-15 23:46:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 818. [2019-11-15 23:46:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-11-15 23:46:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1432 transitions. [2019-11-15 23:46:18,376 INFO L711 BuchiCegarLoop]: Abstraction has 818 states and 1432 transitions. [2019-11-15 23:46:18,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:18,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:18,377 INFO L87 Difference]: Start difference. First operand 818 states and 1432 transitions. Second operand 3 states. [2019-11-15 23:46:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:18,462 INFO L93 Difference]: Finished difference Result 1080 states and 1855 transitions. [2019-11-15 23:46:18,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:18,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1080 states and 1855 transitions. [2019-11-15 23:46:18,472 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2019-11-15 23:46:18,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1080 states to 1080 states and 1855 transitions. [2019-11-15 23:46:18,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 [2019-11-15 23:46:18,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 632 [2019-11-15 23:46:18,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1080 states and 1855 transitions. [2019-11-15 23:46:18,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:18,484 INFO L688 BuchiCegarLoop]: Abstraction has 1080 states and 1855 transitions. [2019-11-15 23:46:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states and 1855 transitions. [2019-11-15 23:46:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1076. [2019-11-15 23:46:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-15 23:46:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1851 transitions. [2019-11-15 23:46:18,511 INFO L711 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2019-11-15 23:46:18,511 INFO L591 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2019-11-15 23:46:18,511 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:46:18,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1851 transitions. [2019-11-15 23:46:18,517 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2019-11-15 23:46:18,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:18,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:18,519 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-15 23:46:18,519 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-15 23:46:18,520 INFO L791 eck$LassoCheckResult]: Stem: 7037#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; 6857#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; 6858#L406 assume !(1 == ~c_req_up~0); 6859#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6860#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6948#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6949#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7002#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7061#L437-1 assume !(0 == ~e_f~0); 7062#L442-1 assume !(0 == ~e_g~0); 6900#L447-1 assume !(0 == ~e_e~0); 6901#L452-1 assume !(0 == ~e_c~0); 7007#L457-1 assume !(0 == ~e_wl~0); 7008#L462-1 assume !(1 == ~wl_pc~0); 6995#L474 assume !(2 == ~wl_pc~0); 6996#L475 assume !(1 == ~c1_pc~0); 7097#L485 assume !(1 == ~c2_pc~0); 6880#L494 assume !(1 == ~wb_pc~0); 6881#L503 assume !(1 == ~e_c~0); 7035#L512-1 assume !(1 == ~e_e~0); 7036#L517-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7105#L522-1 assume !(1 == ~e_g~0); 6883#L527-1 assume !(1 == ~e_c~0); 6884#L532-1 assume !(1 == ~e_wl~0); 7409#L674-1 assume !false; 7410#L544 [2019-11-15 23:46:18,520 INFO L793 eck$LassoCheckResult]: Loop: 7410#L544 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; 7511#L379 assume !false; 7512#L297 assume !(0 == ~wl_st~0); 7507#L301 assume !(0 == ~c1_st~0); 7508#L304 assume !(0 == ~c2_st~0); 7500#L307 assume !(0 == ~wb_st~0); 7501#L310 assume !(0 == ~r_st~0); 7573#L395 start_simulation_~kernel_st~0 := 2; 7568#L550 assume !(1 == ~c_req_up~0); 7565#L550-2 start_simulation_~kernel_st~0 := 3; 7562#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 7560#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7561#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7556#L572-1 assume !(0 == ~e_c~0); 7557#L577-1 assume !(0 == ~e_wl~0); 7551#L582-1 assume !(1 == ~wl_pc~0); 7552#L594 assume !(2 == ~wl_pc~0); 7547#L595 assume !(1 == ~c1_pc~0); 7546#L605 assume !(1 == ~c2_pc~0); 7539#L614 assume !(1 == ~wb_pc~0); 7540#L623 assume !(1 == ~e_c~0); 7535#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7536#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7528#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7529#L647-1 assume !(1 == ~e_c~0); 7524#L652-1 assume !(1 == ~e_wl~0); 7525#L657-1 assume 0 == ~wl_st~0; 7514#L674-1 assume !false; 7410#L544 [2019-11-15 23:46:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:18,521 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2019-11-15 23:46:18,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:18,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66760362] [2019-11-15 23:46:18,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:18,556 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-15 23:46:18,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66760362] [2019-11-15 23:46:18,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:18,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:46:18,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491328119] [2019-11-15 23:46:18,557 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628252, now seen corresponding path program 1 times [2019-11-15 23:46:18,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:18,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134632463] [2019-11-15 23:46:18,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:18,575 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-15 23:46:18,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134632463] [2019-11-15 23:46:18,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:18,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:18,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118714016] [2019-11-15 23:46:18,577 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:46:18,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:18,577 INFO L87 Difference]: Start difference. First operand 1076 states and 1851 transitions. cyclomatic complexity: 786 Second operand 4 states. [2019-11-15 23:46:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:18,730 INFO L93 Difference]: Finished difference Result 1310 states and 2219 transitions. [2019-11-15 23:46:18,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:18,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 2219 transitions. [2019-11-15 23:46:18,745 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 623 [2019-11-15 23:46:18,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1310 states and 2219 transitions. [2019-11-15 23:46:18,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 778 [2019-11-15 23:46:18,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 778 [2019-11-15 23:46:18,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1310 states and 2219 transitions. [2019-11-15 23:46:18,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:18,763 INFO L688 BuchiCegarLoop]: Abstraction has 1310 states and 2219 transitions. [2019-11-15 23:46:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states and 2219 transitions. [2019-11-15 23:46:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1271. [2019-11-15 23:46:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-11-15 23:46:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2169 transitions. [2019-11-15 23:46:18,795 INFO L711 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2019-11-15 23:46:18,795 INFO L591 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2019-11-15 23:46:18,795 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:46:18,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2169 transitions. [2019-11-15 23:46:18,803 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 620 [2019-11-15 23:46:18,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:18,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:18,804 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-15 23:46:18,804 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-15 23:46:18,805 INFO L791 eck$LassoCheckResult]: Stem: 9429#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; 9256#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; 9257#L406 assume !(1 == ~c_req_up~0); 9291#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9296#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9297#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9400#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9401#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9430#L437-1 assume !(0 == ~e_f~0); 9203#L442-1 assume !(0 == ~e_g~0); 9204#L447-1 assume !(0 == ~e_e~0); 9302#L452-1 assume !(0 == ~e_c~0); 9358#L457-1 assume !(0 == ~e_wl~0); 9518#L462-1 assume !(1 == ~wl_pc~0); 9509#L474 assume !(2 == ~wl_pc~0); 9503#L475 assume !(1 == ~c1_pc~0); 9493#L485 assume !(1 == ~c2_pc~0); 9485#L494 assume !(1 == ~wb_pc~0); 9478#L503 assume !(1 == ~e_c~0); 9473#L512-1 assume !(1 == ~e_e~0); 9468#L517-1 assume !(1 == ~e_f~0); 9465#L522-1 assume !(1 == ~e_g~0); 9282#L527-1 assume !(1 == ~e_c~0); 9283#L532-1 assume !(1 == ~e_wl~0); 9341#L674-1 assume !false; 9853#L544 [2019-11-15 23:46:18,806 INFO L793 eck$LassoCheckResult]: Loop: 9853#L544 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; 10286#L379 assume !false; 10282#L297 assume !(0 == ~wl_st~0); 10283#L301 assume !(0 == ~c1_st~0); 10285#L304 assume !(0 == ~c2_st~0); 10280#L307 assume !(0 == ~wb_st~0); 10281#L310 assume !(0 == ~r_st~0); 10284#L395 start_simulation_~kernel_st~0 := 2; 10398#L550 assume !(1 == ~c_req_up~0); 10399#L550-2 start_simulation_~kernel_st~0 := 3; 10425#L562 assume !(0 == ~e_f~0); 10424#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10423#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10422#L572-1 assume !(0 == ~e_c~0); 10421#L577-1 assume !(0 == ~e_wl~0); 10419#L582-1 assume !(1 == ~wl_pc~0); 10418#L594 assume !(2 == ~wl_pc~0); 10416#L595 assume !(1 == ~c1_pc~0); 10414#L605 assume !(1 == ~c2_pc~0); 10411#L614 assume !(1 == ~wb_pc~0); 10410#L623 assume !(1 == ~e_c~0); 10409#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 9315#L637-1 assume !(1 == ~e_f~0); 9316#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9368#L647-1 assume !(1 == ~e_c~0); 9415#L652-1 assume !(1 == ~e_wl~0); 10318#L657-1 assume 0 == ~wl_st~0; 10297#L674-1 assume !false; 9853#L544 [2019-11-15 23:46:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:18,806 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2019-11-15 23:46:18,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:18,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519061660] [2019-11-15 23:46:18,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:18,840 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 520452640, now seen corresponding path program 1 times [2019-11-15 23:46:18,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:18,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227874667] [2019-11-15 23:46:18,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:18,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:18,862 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-15 23:46:18,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227874667] [2019-11-15 23:46:18,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:18,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:18,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273086747] [2019-11-15 23:46:18,864 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:46:18,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:18,865 INFO L87 Difference]: Start difference. First operand 1271 states and 2169 transitions. cyclomatic complexity: 909 Second operand 3 states. [2019-11-15 23:46:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:18,916 INFO L93 Difference]: Finished difference Result 1965 states and 3310 transitions. [2019-11-15 23:46:18,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:18,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1965 states and 3310 transitions. [2019-11-15 23:46:18,935 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2019-11-15 23:46:18,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1965 states to 1965 states and 3310 transitions. [2019-11-15 23:46:18,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1131 [2019-11-15 23:46:18,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1131 [2019-11-15 23:46:18,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1965 states and 3310 transitions. [2019-11-15 23:46:18,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:18,956 INFO L688 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-11-15 23:46:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states and 3310 transitions. [2019-11-15 23:46:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1965. [2019-11-15 23:46:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-11-15 23:46:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3310 transitions. [2019-11-15 23:46:19,007 INFO L711 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-11-15 23:46:19,007 INFO L591 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-11-15 23:46:19,007 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:46:19,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1965 states and 3310 transitions. [2019-11-15 23:46:19,038 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2019-11-15 23:46:19,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:19,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:19,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] [2019-11-15 23:46:19,039 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, 1] [2019-11-15 23:46:19,040 INFO L791 eck$LassoCheckResult]: Stem: 12681#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; 12498#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; 12499#L406 assume !(1 == ~c_req_up~0); 12534#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 12537#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 12538#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 12651#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 12652#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 12702#L437-1 assume !(0 == ~e_f~0); 12445#L442-1 assume !(0 == ~e_g~0); 12446#L447-1 assume !(0 == ~e_e~0); 12613#L452-1 assume !(0 == ~e_c~0); 12614#L457-1 assume !(0 == ~e_wl~0); 12657#L462-1 assume !(1 == ~wl_pc~0); 12646#L474 assume !(2 == ~wl_pc~0); 12512#L475 assume !(1 == ~c1_pc~0); 12505#L485 assume !(1 == ~c2_pc~0); 12521#L494 assume !(1 == ~wb_pc~0); 12522#L503 assume !(1 == ~e_c~0); 12712#L512-1 assume !(1 == ~e_e~0); 12729#L517-1 assume !(1 == ~e_f~0); 12715#L522-1 assume !(1 == ~e_g~0); 12524#L527-1 assume !(1 == ~e_c~0); 12525#L532-1 assume !(1 == ~e_wl~0); 12593#L674-1 assume !false; 13019#L544 [2019-11-15 23:46:19,040 INFO L793 eck$LassoCheckResult]: Loop: 13019#L544 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; 13534#L379 assume !false; 13582#L297 assume !(0 == ~wl_st~0); 13584#L301 assume !(0 == ~c1_st~0); 13648#L304 assume !(0 == ~c2_st~0); 13649#L307 assume !(0 == ~wb_st~0); 13643#L310 assume !(0 == ~r_st~0); 13645#L395 start_simulation_~kernel_st~0 := 2; 13779#L550 assume !(1 == ~c_req_up~0); 13777#L550-2 start_simulation_~kernel_st~0 := 3; 13774#L562 assume !(0 == ~e_f~0); 13772#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 13769#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 13766#L572-1 assume !(0 == ~e_c~0); 13764#L577-1 assume !(0 == ~e_wl~0); 13762#L582-1 assume !(1 == ~wl_pc~0); 13760#L594 assume 2 == ~wl_pc~0; 13758#L596 assume 1 == ~e_e~0;~wl_st~0 := 0; 13757#L595 assume !(1 == ~c1_pc~0); 13755#L605 assume !(1 == ~c2_pc~0); 13752#L614 assume !(1 == ~wb_pc~0); 13751#L623 assume !(1 == ~e_c~0); 13750#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 13749#L637-1 assume !(1 == ~e_f~0); 13748#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 13747#L647-1 assume !(1 == ~e_c~0); 13746#L652-1 assume !(1 == ~e_wl~0); 13744#L657-1 assume 0 == ~wl_st~0; 13743#L674-1 assume !false; 13019#L544 [2019-11-15 23:46:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:19,040 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2019-11-15 23:46:19,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:19,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851559844] [2019-11-15 23:46:19,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:19,053 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1794894215, now seen corresponding path program 1 times [2019-11-15 23:46:19,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:19,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820583020] [2019-11-15 23:46:19,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:19,063 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1157500386, now seen corresponding path program 1 times [2019-11-15 23:46:19,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:19,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164663857] [2019-11-15 23:46:19,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:19,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:19,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164663857] [2019-11-15 23:46:19,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:19,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:19,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053734909] [2019-11-15 23:46:19,217 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-11-15 23:46:19,269 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:46:19,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:46:19,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:46:19,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:46:19,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:46:19,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:19,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:46:19,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:46:19,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2019-11-15 23:46:19,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:46:19,270 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:46:19,271 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-15 23:46:19,273 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-15 23:46:19,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-15 23:46:19,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-15 23:46:19,283 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-15 23:46:19,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-15 23:46:19,287 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-15 23:46:19,290 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-15 23:46:19,294 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-15 23:46:19,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-15 23:46:19,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-15 23:46:19,304 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-15 23:46:19,313 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-15 23:46:19,316 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-15 23:46:19,325 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-15 23:46:19,328 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-15 23:46:19,334 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-15 23:46:19,336 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-15 23:46:19,338 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-15 23:46:19,340 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-15 23:46:19,343 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-15 23:46:19,345 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-15 23:46:19,347 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-15 23:46:19,349 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-15 23:46:19,359 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-15 23:46:19,368 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-15 23:46:19,614 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:19,614 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:19,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:19,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:19,636 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:19,637 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 /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:19,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:19,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:19,645 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:19,646 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 /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:19,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:19,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:46:19,654 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:46:19,654 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:19,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:46:19,660 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/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-15 23:46:19,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:46:19,677 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:19,680 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:46:19,685 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:46:19,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:46:19,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:46:19,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:46:19,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:46:19,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:19,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:46:19,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:46:19,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2019-11-15 23:46:19,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:46:19,685 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:46:19,687 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-15 23:46:19,691 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-15 23:46:19,695 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-15 23:46:19,699 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-15 23:46:19,701 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-15 23:46:19,702 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-15 23:46:19,703 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-15 23:46:19,705 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-15 23:46:19,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-15 23:46:19,719 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-15 23:46:19,721 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-15 23:46:19,725 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-15 23:46:19,727 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-15 23:46:19,731 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-15 23:46:19,733 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-15 23:46:19,737 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-15 23:46:19,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-15 23:46:19,740 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-15 23:46:19,750 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-15 23:46:19,753 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-15 23:46:19,754 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-15 23:46:19,757 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-15 23:46:19,758 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-15 23:46:19,760 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-15 23:46:19,762 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-15 23:46:19,763 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-15 23:46:19,993 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:19,993 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:46:19,994 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-15 23:46:19,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:19,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:19,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:19,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:19,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:19,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:19,995 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:19,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:19,997 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-15 23:46:19,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:19,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:19,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:19,998 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:46:19,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:19,998 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:46:19,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:19,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:19,999 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-15 23:46:20,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:20,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:20,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:20,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:20,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:20,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:20,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:20,010 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:46:20,011 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:46:20,011 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:46:20,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:46:20,012 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:46:20,012 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:46:20,012 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2019-11-15 23:46:20,013 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:46:20,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:20,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:20,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:20,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:46:20,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:20,097 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-15 23:46:20,098 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-15 23:46:20,098 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356 Second operand 5 states. [2019-11-15 23:46:20,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356. Second operand 5 states. Result 5576 states and 9355 transitions. Complement of second has 5 states. [2019-11-15 23:46:20,164 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-15 23:46:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:46:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2019-11-15 23:46:20,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 29 letters. [2019-11-15 23:46:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 54 letters. Loop has 29 letters. [2019-11-15 23:46:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 58 letters. [2019-11-15 23:46:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:20,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5576 states and 9355 transitions. [2019-11-15 23:46:20,210 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1920 [2019-11-15 23:46:20,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5576 states to 5576 states and 9355 transitions. [2019-11-15 23:46:20,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2105 [2019-11-15 23:46:20,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2138 [2019-11-15 23:46:20,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5576 states and 9355 transitions. [2019-11-15 23:46:20,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:20,260 INFO L688 BuchiCegarLoop]: Abstraction has 5576 states and 9355 transitions. [2019-11-15 23:46:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states and 9355 transitions. [2019-11-15 23:46:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5543. [2019-11-15 23:46:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5543 states. [2019-11-15 23:46:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9295 transitions. [2019-11-15 23:46:20,382 INFO L711 BuchiCegarLoop]: Abstraction has 5543 states and 9295 transitions. [2019-11-15 23:46:20,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:20,383 INFO L87 Difference]: Start difference. First operand 5543 states and 9295 transitions. Second operand 3 states. [2019-11-15 23:46:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:20,434 INFO L93 Difference]: Finished difference Result 5023 states and 8398 transitions. [2019-11-15 23:46:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:20,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5023 states and 8398 transitions. [2019-11-15 23:46:20,467 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2019-11-15 23:46:20,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5023 states to 5023 states and 8398 transitions. [2019-11-15 23:46:20,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1932 [2019-11-15 23:46:20,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1932 [2019-11-15 23:46:20,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5023 states and 8398 transitions. [2019-11-15 23:46:20,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:20,507 INFO L688 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-11-15 23:46:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states and 8398 transitions. [2019-11-15 23:46:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5023. [2019-11-15 23:46:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-11-15 23:46:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 8398 transitions. [2019-11-15 23:46:20,606 INFO L711 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-11-15 23:46:20,606 INFO L591 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-11-15 23:46:20,607 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:46:20,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5023 states and 8398 transitions. [2019-11-15 23:46:20,621 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2019-11-15 23:46:20,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:20,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:20,622 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-15 23:46:20,622 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:20,623 INFO L791 eck$LassoCheckResult]: Stem: 30991#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; 30789#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; 30790#L406 assume !(1 == ~c_req_up~0); 30835#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 30839#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 30840#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 30957#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 30958#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 31007#L437-1 assume !(0 == ~e_f~0); 31008#L442-1 assume !(0 == ~e_g~0); 30845#L447-1 assume !(0 == ~e_e~0); 30846#L452-1 assume !(0 == ~e_c~0); 31056#L457-1 assume !(0 == ~e_wl~0); 31055#L462-1 assume !(1 == ~wl_pc~0); 31052#L474 assume !(2 == ~wl_pc~0); 31051#L475 assume !(1 == ~c1_pc~0); 31049#L485 assume !(1 == ~c2_pc~0); 31040#L494 assume !(1 == ~wb_pc~0); 31035#L503 assume !(1 == ~e_c~0); 31031#L512-1 assume !(1 == ~e_e~0); 31026#L517-1 assume !(1 == ~e_f~0); 31025#L522-1 assume !(1 == ~e_g~0); 30826#L527-1 assume !(1 == ~e_c~0); 30827#L532-1 assume !(1 == ~e_wl~0); 31481#L674-1 assume !false; 31476#L544 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; 31477#L379 [2019-11-15 23:46:20,623 INFO L793 eck$LassoCheckResult]: Loop: 31477#L379 assume !false; 31493#L297 assume 0 == ~wl_st~0; 31492#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31472#L323 assume !(0 != eval_~tmp~0); 31473#L319 assume !(0 == ~c1_st~0); 31602#L334 assume !(0 == ~c2_st~0); 31575#L349 assume !(0 == ~wb_st~0); 31523#L364 assume !(0 == ~r_st~0); 31477#L379 [2019-11-15 23:46:20,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:20,624 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-11-15 23:46:20,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:20,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998702877] [2019-11-15 23:46:20,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:20,642 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:20,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1289372155, now seen corresponding path program 1 times [2019-11-15 23:46:20,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:20,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956176950] [2019-11-15 23:46:20,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:20,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash 370417651, now seen corresponding path program 1 times [2019-11-15 23:46:20,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:20,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482613005] [2019-11-15 23:46:20,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:20,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:20,690 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-15 23:46:20,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482613005] [2019-11-15 23:46:20,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:20,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:20,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107672355] [2019-11-15 23:46:20,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:20,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:20,717 INFO L87 Difference]: Start difference. First operand 5023 states and 8398 transitions. cyclomatic complexity: 3408 Second operand 3 states. [2019-11-15 23:46:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:20,796 INFO L93 Difference]: Finished difference Result 7959 states and 13148 transitions. [2019-11-15 23:46:20,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:20,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7959 states and 13148 transitions. [2019-11-15 23:46:20,834 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2019-11-15 23:46:20,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7959 states to 7959 states and 13148 transitions. [2019-11-15 23:46:20,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3015 [2019-11-15 23:46:20,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3015 [2019-11-15 23:46:20,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7959 states and 13148 transitions. [2019-11-15 23:46:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:20,905 INFO L688 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-11-15 23:46:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states and 13148 transitions. [2019-11-15 23:46:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7959. [2019-11-15 23:46:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7959 states. [2019-11-15 23:46:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13148 transitions. [2019-11-15 23:46:21,049 INFO L711 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-11-15 23:46:21,049 INFO L591 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-11-15 23:46:21,049 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:46:21,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7959 states and 13148 transitions. [2019-11-15 23:46:21,077 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2019-11-15 23:46:21,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:21,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:21,078 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-15 23:46:21,078 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:21,078 INFO L791 eck$LassoCheckResult]: Stem: 43968#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; 43776#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; 43777#L406 assume !(1 == ~c_req_up~0); 43820#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43823#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43824#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43941#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43942#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43988#L437-1 assume !(0 == ~e_f~0); 43989#L442-1 assume !(0 == ~e_g~0); 43829#L447-1 assume !(0 == ~e_e~0); 43830#L452-1 assume !(0 == ~e_c~0); 44041#L457-1 assume !(0 == ~e_wl~0); 44040#L462-1 assume !(1 == ~wl_pc~0); 44037#L474 assume !(2 == ~wl_pc~0); 44036#L475 assume !(1 == ~c1_pc~0); 44034#L485 assume !(1 == ~c2_pc~0); 44025#L494 assume !(1 == ~wb_pc~0); 44020#L503 assume !(1 == ~e_c~0); 44016#L512-1 assume !(1 == ~e_e~0); 44011#L517-1 assume !(1 == ~e_f~0); 44010#L522-1 assume !(1 == ~e_g~0); 43810#L527-1 assume !(1 == ~e_c~0); 43811#L532-1 assume !(1 == ~e_wl~0); 44728#L674-1 assume !false; 44729#L544 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; 44716#L379 [2019-11-15 23:46:21,078 INFO L793 eck$LassoCheckResult]: Loop: 44716#L379 assume !false; 44634#L297 assume 0 == ~wl_st~0; 44603#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 44596#L323 assume !(0 != eval_~tmp~0); 44597#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 47915#L338 assume !(0 != eval_~tmp___0~0); 44734#L334 assume !(0 == ~c2_st~0); 44732#L349 assume !(0 == ~wb_st~0); 44722#L364 assume !(0 == ~r_st~0); 44716#L379 [2019-11-15 23:46:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-11-15 23:46:21,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:21,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45149671] [2019-11-15 23:46:21,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:21,103 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 1 times [2019-11-15 23:46:21,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:21,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344493893] [2019-11-15 23:46:21,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:21,116 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1452726936, now seen corresponding path program 1 times [2019-11-15 23:46:21,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:21,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81909489] [2019-11-15 23:46:21,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:21,148 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-15 23:46:21,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81909489] [2019-11-15 23:46:21,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:21,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:21,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861826453] [2019-11-15 23:46:21,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:21,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:21,246 INFO L87 Difference]: Start difference. First operand 7959 states and 13148 transitions. cyclomatic complexity: 5222 Second operand 3 states. [2019-11-15 23:46:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:21,327 INFO L93 Difference]: Finished difference Result 12649 states and 20599 transitions. [2019-11-15 23:46:21,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:21,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12649 states and 20599 transitions. [2019-11-15 23:46:21,379 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-11-15 23:46:21,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12649 states to 12649 states and 20599 transitions. [2019-11-15 23:46:21,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4840 [2019-11-15 23:46:21,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4840 [2019-11-15 23:46:21,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12649 states and 20599 transitions. [2019-11-15 23:46:21,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:21,433 INFO L688 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-11-15 23:46:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12649 states and 20599 transitions. [2019-11-15 23:46:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12649 to 12649. [2019-11-15 23:46:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12649 states. [2019-11-15 23:46:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 20599 transitions. [2019-11-15 23:46:21,591 INFO L711 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-11-15 23:46:21,591 INFO L591 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-11-15 23:46:21,591 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:46:21,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12649 states and 20599 transitions. [2019-11-15 23:46:21,627 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-11-15 23:46:21,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:21,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:21,628 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-15 23:46:21,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:21,629 INFO L791 eck$LassoCheckResult]: Stem: 64580#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; 64392#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; 64393#L406 assume !(1 == ~c_req_up~0); 64433#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 64436#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 64437#L422-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 64547#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 64548#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 64598#L437-1 assume !(0 == ~e_f~0); 64599#L442-1 assume !(0 == ~e_g~0); 66129#L447-1 assume !(0 == ~e_e~0); 66128#L452-1 assume !(0 == ~e_c~0); 66127#L457-1 assume !(0 == ~e_wl~0); 66126#L462-1 assume !(1 == ~wl_pc~0); 64660#L474 assume !(2 == ~wl_pc~0); 64661#L475 assume !(1 == ~c1_pc~0); 64656#L485 assume !(1 == ~c2_pc~0); 64655#L494 assume !(1 == ~wb_pc~0); 64643#L503 assume !(1 == ~e_c~0); 64644#L512-1 assume !(1 == ~e_e~0); 64630#L517-1 assume !(1 == ~e_f~0); 64631#L522-1 assume !(1 == ~e_g~0); 64423#L527-1 assume !(1 == ~e_c~0); 64424#L532-1 assume !(1 == ~e_wl~0); 65800#L674-1 assume !false; 65795#L544 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; 65796#L379 [2019-11-15 23:46:21,629 INFO L793 eck$LassoCheckResult]: Loop: 65796#L379 assume !false; 65934#L297 assume 0 == ~wl_st~0; 65933#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 65930#L323 assume !(0 != eval_~tmp~0); 65929#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 65888#L338 assume !(0 != eval_~tmp___0~0); 65919#L334 assume !(0 == ~c2_st~0); 65921#L349 assume !(0 == ~wb_st~0); 65901#L364 assume !(0 == ~r_st~0); 65796#L379 [2019-11-15 23:46:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-11-15 23:46:21,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:21,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336730947] [2019-11-15 23:46:21,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:21,646 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-15 23:46:21,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336730947] [2019-11-15 23:46:21,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:21,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:21,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739964588] [2019-11-15 23:46:21,647 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:46:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 2 times [2019-11-15 23:46:21,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:21,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249639680] [2019-11-15 23:46:21,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:21,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:21,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:21,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:21,696 INFO L87 Difference]: Start difference. First operand 12649 states and 20599 transitions. cyclomatic complexity: 7983 Second operand 3 states. [2019-11-15 23:46:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:21,760 INFO L93 Difference]: Finished difference Result 12547 states and 20414 transitions. [2019-11-15 23:46:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:21,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12547 states and 20414 transitions. [2019-11-15 23:46:21,814 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-11-15 23:46:21,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12547 states to 12547 states and 20414 transitions. [2019-11-15 23:46:21,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4741 [2019-11-15 23:46:21,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4741 [2019-11-15 23:46:21,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12547 states and 20414 transitions. [2019-11-15 23:46:21,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:21,869 INFO L688 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-11-15 23:46:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12547 states and 20414 transitions. [2019-11-15 23:46:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12547 to 12547. [2019-11-15 23:46:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12547 states. [2019-11-15 23:46:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12547 states to 12547 states and 20414 transitions. [2019-11-15 23:46:22,029 INFO L711 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-11-15 23:46:22,029 INFO L591 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-11-15 23:46:22,029 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 23:46:22,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12547 states and 20414 transitions. [2019-11-15 23:46:22,065 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-11-15 23:46:22,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:22,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:22,066 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-15 23:46:22,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:22,066 INFO L791 eck$LassoCheckResult]: Stem: 89791#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; 89595#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; 89596#L406 assume !(1 == ~c_req_up~0); 89638#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 89641#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 89642#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 89760#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 89761#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 89810#L437-1 assume !(0 == ~e_f~0); 89811#L442-1 assume !(0 == ~e_g~0); 89647#L447-1 assume !(0 == ~e_e~0); 89648#L452-1 assume !(0 == ~e_c~0); 89867#L457-1 assume !(0 == ~e_wl~0); 89866#L462-1 assume !(1 == ~wl_pc~0); 89863#L474 assume !(2 == ~wl_pc~0); 89862#L475 assume !(1 == ~c1_pc~0); 89860#L485 assume !(1 == ~c2_pc~0); 89851#L494 assume !(1 == ~wb_pc~0); 89846#L503 assume !(1 == ~e_c~0); 89842#L512-1 assume !(1 == ~e_e~0); 89837#L517-1 assume !(1 == ~e_f~0); 89836#L522-1 assume !(1 == ~e_g~0); 89628#L527-1 assume !(1 == ~e_c~0); 89629#L532-1 assume !(1 == ~e_wl~0); 91148#L674-1 assume !false; 91149#L544 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; 91095#L379 [2019-11-15 23:46:22,066 INFO L793 eck$LassoCheckResult]: Loop: 91095#L379 assume !false; 95831#L297 assume 0 == ~wl_st~0; 95826#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 95824#L323 assume !(0 != eval_~tmp~0); 95822#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91014#L338 assume !(0 != eval_~tmp___0~0); 95820#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91144#L353 assume !(0 != eval_~tmp___1~0); 91105#L349 assume !(0 == ~wb_st~0); 91097#L364 assume !(0 == ~r_st~0); 91095#L379 [2019-11-15 23:46:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-11-15 23:46:22,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:22,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149940512] [2019-11-15 23:46:22,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,080 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash 560500646, now seen corresponding path program 1 times [2019-11-15 23:46:22,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:22,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338319695] [2019-11-15 23:46:22,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,086 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2086482018, now seen corresponding path program 1 times [2019-11-15 23:46:22,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:22,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376287694] [2019-11-15 23:46:22,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:22,104 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-15 23:46:22,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376287694] [2019-11-15 23:46:22,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:22,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:46:22,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319381933] [2019-11-15 23:46:22,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:46:22,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:46:22,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:46:22,169 INFO L87 Difference]: Start difference. First operand 12547 states and 20414 transitions. cyclomatic complexity: 7900 Second operand 3 states. [2019-11-15 23:46:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:22,267 INFO L93 Difference]: Finished difference Result 21409 states and 34276 transitions. [2019-11-15 23:46:22,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:46:22,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21409 states and 34276 transitions. [2019-11-15 23:46:22,357 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2019-11-15 23:46:22,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21409 states to 21409 states and 34276 transitions. [2019-11-15 23:46:22,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8025 [2019-11-15 23:46:22,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8025 [2019-11-15 23:46:22,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21409 states and 34276 transitions. [2019-11-15 23:46:22,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:22,452 INFO L688 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-11-15 23:46:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21409 states and 34276 transitions. [2019-11-15 23:46:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21409 to 21409. [2019-11-15 23:46:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21409 states. [2019-11-15 23:46:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21409 states to 21409 states and 34276 transitions. [2019-11-15 23:46:22,895 INFO L711 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-11-15 23:46:22,895 INFO L591 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-11-15 23:46:22,895 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 23:46:22,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21409 states and 34276 transitions. [2019-11-15 23:46:22,950 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2019-11-15 23:46:22,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:22,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:22,951 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-15 23:46:22,951 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:22,951 INFO L791 eck$LassoCheckResult]: Stem: 123758#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; 123558#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; 123559#L406 assume !(1 == ~c_req_up~0); 123603#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 123607#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 123608#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 123725#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 123726#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 123775#L437-1 assume !(0 == ~e_f~0); 123776#L442-1 assume !(0 == ~e_g~0); 123613#L447-1 assume !(0 == ~e_e~0); 123614#L452-1 assume !(0 == ~e_c~0); 123847#L457-1 assume !(0 == ~e_wl~0); 123846#L462-1 assume !(1 == ~wl_pc~0); 123843#L474 assume !(2 == ~wl_pc~0); 123842#L475 assume !(1 == ~c1_pc~0); 123840#L485 assume !(1 == ~c2_pc~0); 123831#L494 assume !(1 == ~wb_pc~0); 123826#L503 assume !(1 == ~e_c~0); 123822#L512-1 assume !(1 == ~e_e~0); 123817#L517-1 assume !(1 == ~e_f~0); 123816#L522-1 assume !(1 == ~e_g~0); 123594#L527-1 assume !(1 == ~e_c~0); 123595#L532-1 assume !(1 == ~e_wl~0); 125339#L674-1 assume !false; 125340#L544 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; 124987#L379 [2019-11-15 23:46:22,957 INFO L793 eck$LassoCheckResult]: Loop: 124987#L379 assume !false; 124984#L297 assume 0 == ~wl_st~0; 124981#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 124977#L323 assume !(0 != eval_~tmp~0); 124978#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126122#L338 assume !(0 != eval_~tmp___0~0); 125605#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 125560#L353 assume !(0 != eval_~tmp___1~0); 125303#L349 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 125300#L368 assume !(0 != eval_~tmp___2~0); 125299#L364 assume !(0 == ~r_st~0); 124987#L379 [2019-11-15 23:46:22,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:22,957 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2019-11-15 23:46:22,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:22,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786947348] [2019-11-15 23:46:22,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash 195616437, now seen corresponding path program 1 times [2019-11-15 23:46:22,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:22,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272611116] [2019-11-15 23:46:22,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:22,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -256467523, now seen corresponding path program 1 times [2019-11-15 23:46:22,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:22,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73052383] [2019-11-15 23:46:22,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:22,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:22,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:23,537 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-11-15 23:46:23,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:46:23 BoogieIcfgContainer [2019-11-15 23:46:23,655 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:46:23,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:46:23,656 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:46:23,656 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:46:23,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:14" (3/4) ... [2019-11-15 23:46:23,660 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:46:23,753 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9e845df9-07d3-4761-bc5c-32a7a5ad453a/bin/uautomizer/witness.graphml [2019-11-15 23:46:23,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:46:23,755 INFO L168 Benchmark]: Toolchain (without parser) took 10810.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:23,755 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:46:23,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:23,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:23,756 INFO L168 Benchmark]: Boogie Preprocessor took 35.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:46:23,757 INFO L168 Benchmark]: RCFGBuilder took 792.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:23,757 INFO L168 Benchmark]: BuchiAutomizer took 9426.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.6 MB). Peak memory consumption was 223.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:23,757 INFO L168 Benchmark]: Witness Printer took 97.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:23,759 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 792.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9426.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.6 MB). Peak memory consumption was 223.0 MB. Max. memory is 11.5 GB. * Witness Printer took 97.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 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 -1 * e_f + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 21409 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 417 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 21409 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4213 SDtfs, 3526 SDslu, 2462 SDs, 0 SdLazy, 323 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI5 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 296]: 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@6d120f8f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e388868=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6464ffa6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ec54bde=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a8e356c=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: 296]: 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 ; [L691] int __retres1 ; [L695] e_wl = 2 [L696] e_c = e_wl [L697] e_g = e_c [L698] e_f = e_g [L699] e_e = e_f [L700] wl_pc = 0 [L701] c1_pc = 0 [L702] c2_pc = 0 [L703] wb_pc = 0 [L704] wb_i = 1 [L705] c2_i = wb_i [L706] c1_i = c2_i [L707] wl_i = c1_i [L708] r_i = 0 [L709] c_req_up = 0 [L710] d = 0 [L711] c = 0 [L402] int kernel_st ; [L405] kernel_st = 0 [L406] COND FALSE !((int )c_req_up == 1) [L417] COND TRUE (int )wl_i == 1 [L418] wl_st = 0 [L422] COND TRUE (int )c1_i == 1 [L423] c1_st = 0 [L427] COND TRUE (int )c2_i == 1 [L428] c2_st = 0 [L432] COND TRUE (int )wb_i == 1 [L433] wb_st = 0 [L437] COND FALSE !((int )r_i == 1) [L440] r_st = 2 [L442] COND FALSE !((int )e_f == 0) [L447] COND FALSE !((int )e_g == 0) [L452] COND FALSE !((int )e_e == 0) [L457] COND FALSE !((int )e_c == 0) [L462] COND FALSE !((int )e_wl == 0) [L467] COND FALSE !((int )wl_pc == 1) [L475] COND FALSE !((int )wl_pc == 2) [L485] COND FALSE !((int )c1_pc == 1) [L494] COND FALSE !((int )c2_pc == 1) [L503] COND FALSE !((int )wb_pc == 1) [L512] COND FALSE !((int )e_c == 1) [L517] COND FALSE !((int )e_e == 1) [L522] COND FALSE !((int )e_f == 1) [L527] COND FALSE !((int )e_g == 1) [L532] COND FALSE !((int )e_c == 1) [L537] COND FALSE !((int )e_wl == 1) [L543] COND TRUE 1 [L546] kernel_st = 1 [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; Loop: [L296] COND TRUE 1 [L298] COND TRUE (int )wl_st == 0 [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND FALSE !(\read(tmp)) [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND FALSE !(\read(tmp___0)) [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp___1)) [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND FALSE !(\read(tmp___2)) [L379] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...