./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd54b1bc34218a081600cff9517fd9b1806e0ce2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 13:59:39,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:59:39,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:59:39,708 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:59:39,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:59:39,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:59:39,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:59:39,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:59:39,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:59:39,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:59:39,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:59:39,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:59:39,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:59:39,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:59:39,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:59:39,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:59:39,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:59:39,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:59:39,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:59:39,716 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:59:39,717 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:59:39,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:59:39,719 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:59:39,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:59:39,719 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:59:39,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:59:39,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:59:39,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:59:39,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:59:39,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:59:39,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:59:39,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:59:39,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:59:39,722 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:59:39,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:59:39,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:59:39,722 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 13:59:39,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:59:39,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:59:39,730 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 13:59:39,730 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 13:59:39,731 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:59:39,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 13:59:39,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 13:59:39,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 13:59:39,732 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 13:59:39,732 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:59:39,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 13:59:39,732 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 13:59:39,732 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 13:59:39,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:59:39,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 13:59:39,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 13:59:39,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:59:39,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 13:59:39,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 13:59:39,733 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 13:59:39,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 13:59:39,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 13:59:39,733 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> dd54b1bc34218a081600cff9517fd9b1806e0ce2 [2018-12-08 13:59:39,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:59:39,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:59:39,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:59:39,761 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:59:39,761 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:59:39,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c [2018-12-08 13:59:39,798 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/data/44a87f988/e3b949fffbc24c9390290395d1a841e3/FLAG97a9d4664 [2018-12-08 13:59:40,255 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:59:40,255 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c [2018-12-08 13:59:40,262 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/data/44a87f988/e3b949fffbc24c9390290395d1a841e3/FLAG97a9d4664 [2018-12-08 13:59:40,270 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/data/44a87f988/e3b949fffbc24c9390290395d1a841e3 [2018-12-08 13:59:40,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:59:40,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 13:59:40,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:59:40,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:59:40,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:59:40,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcf5689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40, skipping insertion in model container [2018-12-08 13:59:40,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:59:40,307 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:59:40,482 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:59:40,485 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:59:40,585 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:59:40,599 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:59:40,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40 WrapperNode [2018-12-08 13:59:40,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:59:40,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 13:59:40,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 13:59:40,600 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 13:59:40,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 13:59:40,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:59:40,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:59:40,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:59:40,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... [2018-12-08 13:59:40,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:59:40,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:59:40,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:59:40,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:59:40,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:59:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 13:59:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:59:40,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:59:41,642 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:59:41,642 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 13:59:41,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:59:41 BoogieIcfgContainer [2018-12-08 13:59:41,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:59:41,644 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 13:59:41,644 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 13:59:41,653 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 13:59:41,653 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:59:41" (1/1) ... [2018-12-08 13:59:41,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:59:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-08 13:59:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-08 13:59:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 13:59:41,700 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 145 states and 221 transitions. [2018-12-08 13:59:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2018-12-08 13:59:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 13:59:42,216 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 149 states and 226 transitions. [2018-12-08 13:59:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2018-12-08 13:59:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 13:59:42,408 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 154 states and 236 transitions. [2018-12-08 13:59:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2018-12-08 13:59:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 13:59:42,520 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 224 states and 321 transitions. [2018-12-08 13:59:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 321 transitions. [2018-12-08 13:59:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 13:59:42,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 234 states and 337 transitions. [2018-12-08 13:59:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 337 transitions. [2018-12-08 13:59:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 13:59:43,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 245 states and 356 transitions. [2018-12-08 13:59:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 356 transitions. [2018-12-08 13:59:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 13:59:43,720 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 247 states and 358 transitions. [2018-12-08 13:59:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 358 transitions. [2018-12-08 13:59:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 13:59:43,830 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 250 states and 361 transitions. [2018-12-08 13:59:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 361 transitions. [2018-12-08 13:59:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 13:59:43,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 253 states and 364 transitions. [2018-12-08 13:59:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 364 transitions. [2018-12-08 13:59:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-08 13:59:44,040 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 13:59:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 264 states and 377 transitions. [2018-12-08 13:59:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 377 transitions. [2018-12-08 13:59:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 13:59:44,232 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 270 states and 386 transitions. [2018-12-08 13:59:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 386 transitions. [2018-12-08 13:59:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 13:59:44,567 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 273 states and 391 transitions. [2018-12-08 13:59:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 391 transitions. [2018-12-08 13:59:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 13:59:44,691 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 275 states and 394 transitions. [2018-12-08 13:59:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 394 transitions. [2018-12-08 13:59:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 13:59:44,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 13:59:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 283 states and 403 transitions. [2018-12-08 13:59:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 403 transitions. [2018-12-08 13:59:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 13:59:45,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 288 states and 410 transitions. [2018-12-08 13:59:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 410 transitions. [2018-12-08 13:59:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 13:59:45,529 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 13:59:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 299 states and 426 transitions. [2018-12-08 13:59:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 426 transitions. [2018-12-08 13:59:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 13:59:46,156 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 13:59:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 302 states and 429 transitions. [2018-12-08 13:59:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 429 transitions. [2018-12-08 13:59:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 13:59:46,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 13:59:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 313 states and 450 transitions. [2018-12-08 13:59:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 450 transitions. [2018-12-08 13:59:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 13:59:46,822 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 13:59:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 318 states and 459 transitions. [2018-12-08 13:59:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 459 transitions. [2018-12-08 13:59:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 13:59:47,049 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 13:59:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 321 states and 463 transitions. [2018-12-08 13:59:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 463 transitions. [2018-12-08 13:59:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 13:59:47,179 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 340 states and 485 transitions. [2018-12-08 13:59:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 485 transitions. [2018-12-08 13:59:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 13:59:47,585 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 13:59:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 357 states and 505 transitions. [2018-12-08 13:59:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 505 transitions. [2018-12-08 13:59:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 13:59:47,924 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 13:59:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2018-12-08 13:59:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2018-12-08 13:59:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 13:59:48,074 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 389 states and 540 transitions. [2018-12-08 13:59:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 540 transitions. [2018-12-08 13:59:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 13:59:48,669 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 405 states and 556 transitions. [2018-12-08 13:59:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 556 transitions. [2018-12-08 13:59:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 13:59:49,002 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 427 states and 584 transitions. [2018-12-08 13:59:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 584 transitions. [2018-12-08 13:59:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 13:59:50,332 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 432 states and 588 transitions. [2018-12-08 13:59:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 588 transitions. [2018-12-08 13:59:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 13:59:50,793 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 13:59:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 440 states and 599 transitions. [2018-12-08 13:59:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 599 transitions. [2018-12-08 13:59:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 13:59:51,450 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 13:59:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 441 states and 600 transitions. [2018-12-08 13:59:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 600 transitions. [2018-12-08 13:59:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-08 13:59:51,686 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 448 states and 613 transitions. [2018-12-08 13:59:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2018-12-08 13:59:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-08 13:59:53,112 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 453 states and 621 transitions. [2018-12-08 13:59:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 621 transitions. [2018-12-08 13:59:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-08 13:59:53,807 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 469 states and 640 transitions. [2018-12-08 13:59:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 640 transitions. [2018-12-08 13:59:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 13:59:54,195 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 13:59:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 480 states and 652 transitions. [2018-12-08 13:59:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 652 transitions. [2018-12-08 13:59:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 13:59:54,262 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 517 states and 696 transitions. [2018-12-08 13:59:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 696 transitions. [2018-12-08 13:59:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 13:59:55,447 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 524 states and 703 transitions. [2018-12-08 13:59:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 703 transitions. [2018-12-08 13:59:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 13:59:56,216 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 529 states and 709 transitions. [2018-12-08 13:59:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 709 transitions. [2018-12-08 13:59:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-08 13:59:56,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 562 states and 754 transitions. [2018-12-08 13:59:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 754 transitions. [2018-12-08 13:59:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-08 13:59:58,963 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:59:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 565 states and 757 transitions. [2018-12-08 13:59:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 757 transitions. [2018-12-08 13:59:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-08 13:59:59,236 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 13:59:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 590 states and 787 transitions. [2018-12-08 13:59:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 787 transitions. [2018-12-08 13:59:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-08 13:59:59,502 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 13:59:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:59:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 597 states and 794 transitions. [2018-12-08 13:59:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 794 transitions. [2018-12-08 13:59:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 13:59:59,546 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:59:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:59:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 613 states and 815 transitions. [2018-12-08 14:00:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 815 transitions. [2018-12-08 14:00:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 14:00:00,959 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 620 states and 823 transitions. [2018-12-08 14:00:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 823 transitions. [2018-12-08 14:00:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 14:00:01,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 14:00:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 636 states and 839 transitions. [2018-12-08 14:00:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 839 transitions. [2018-12-08 14:00:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 14:00:01,836 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 14:00:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 639 states and 842 transitions. [2018-12-08 14:00:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 842 transitions. [2018-12-08 14:00:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 14:00:02,069 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 14:00:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 651 states and 855 transitions. [2018-12-08 14:00:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 855 transitions. [2018-12-08 14:00:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 14:00:02,231 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 716 states and 922 transitions. [2018-12-08 14:00:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 922 transitions. [2018-12-08 14:00:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 14:00:04,195 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 772 states and 983 transitions. [2018-12-08 14:00:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 983 transitions. [2018-12-08 14:00:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 14:00:07,553 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 14:00:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 776 states and 987 transitions. [2018-12-08 14:00:07,600 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 987 transitions. [2018-12-08 14:00:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 14:00:07,601 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 801 states and 1027 transitions. [2018-12-08 14:00:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1027 transitions. [2018-12-08 14:00:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 14:00:10,832 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 848 states and 1073 transitions. [2018-12-08 14:00:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1073 transitions. [2018-12-08 14:00:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 14:00:12,547 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-08 14:00:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 849 states and 1073 transitions. [2018-12-08 14:00:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1073 transitions. [2018-12-08 14:00:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 14:00:12,708 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 888 states and 1112 transitions. [2018-12-08 14:00:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1112 transitions. [2018-12-08 14:00:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 14:00:12,851 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 14:00:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 898 states and 1128 transitions. [2018-12-08 14:00:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1128 transitions. [2018-12-08 14:00:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 14:00:14,101 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 14:00:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 901 states and 1132 transitions. [2018-12-08 14:00:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1132 transitions. [2018-12-08 14:00:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 14:00:14,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 972 states and 1203 transitions. [2018-12-08 14:00:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1203 transitions. [2018-12-08 14:00:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 14:00:15,763 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:00:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1002 states and 1245 transitions. [2018-12-08 14:00:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1245 transitions. [2018-12-08 14:00:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 14:00:20,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:00:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1007 states and 1250 transitions. [2018-12-08 14:00:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1250 transitions. [2018-12-08 14:00:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 14:00:20,760 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 14:00:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1009 states and 1252 transitions. [2018-12-08 14:00:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1252 transitions. [2018-12-08 14:00:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 14:00:20,856 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:00:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1024 states and 1276 transitions. [2018-12-08 14:00:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1276 transitions. [2018-12-08 14:00:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 14:00:22,556 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:00:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1029 states and 1284 transitions. [2018-12-08 14:00:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1284 transitions. [2018-12-08 14:00:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 14:00:23,140 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:00:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1032 states and 1287 transitions. [2018-12-08 14:00:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1287 transitions. [2018-12-08 14:00:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-08 14:00:23,509 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 14:00:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1035 states and 1291 transitions. [2018-12-08 14:00:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1291 transitions. [2018-12-08 14:00:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 14:00:23,716 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1078 states and 1345 transitions. [2018-12-08 14:00:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1345 transitions. [2018-12-08 14:00:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 14:00:27,417 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1083 states and 1350 transitions. [2018-12-08 14:00:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1350 transitions. [2018-12-08 14:00:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-08 14:00:28,186 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 14:00:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1087 states and 1357 transitions. [2018-12-08 14:00:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1357 transitions. [2018-12-08 14:00:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-08 14:00:29,030 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 14:00:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1090 states and 1360 transitions. [2018-12-08 14:00:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1360 transitions. [2018-12-08 14:00:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 14:00:29,362 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1117 states and 1399 transitions. [2018-12-08 14:00:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1399 transitions. [2018-12-08 14:00:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 14:00:33,246 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1125 states and 1406 transitions. [2018-12-08 14:00:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1406 transitions. [2018-12-08 14:00:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 14:00:34,572 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-08 14:00:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1133 states and 1413 transitions. [2018-12-08 14:00:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1413 transitions. [2018-12-08 14:00:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 14:00:34,654 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:00:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1167 states and 1449 transitions. [2018-12-08 14:00:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1449 transitions. [2018-12-08 14:00:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 14:00:36,502 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 14:00:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1169 states and 1451 transitions. [2018-12-08 14:00:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1451 transitions. [2018-12-08 14:00:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-08 14:00:36,630 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1225 states and 1513 transitions. [2018-12-08 14:00:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1513 transitions. [2018-12-08 14:00:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 14:00:42,276 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 14:00:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1276 states and 1569 transitions. [2018-12-08 14:00:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1569 transitions. [2018-12-08 14:00:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-08 14:00:45,533 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:00:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1303 states and 1606 transitions. [2018-12-08 14:00:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1606 transitions. [2018-12-08 14:00:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-08 14:00:47,592 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:00:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:48,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1306 states and 1614 transitions. [2018-12-08 14:00:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1614 transitions. [2018-12-08 14:00:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-08 14:00:48,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:00:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1308 states and 1617 transitions. [2018-12-08 14:00:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1617 transitions. [2018-12-08 14:00:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 14:00:48,576 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1362 states and 1684 transitions. [2018-12-08 14:00:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1684 transitions. [2018-12-08 14:00:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 14:00:52,490 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:00:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:00:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1372 states and 1695 transitions. [2018-12-08 14:00:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1695 transitions. [2018-12-08 14:00:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 14:00:55,251 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:00:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:00:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:00:58,700 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-08 14:01:00,152 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-08 14:01:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1420 states and 1745 transitions. [2018-12-08 14:01:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1745 transitions. [2018-12-08 14:01:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 14:01:02,049 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 14:01:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1420 states and 1744 transitions. [2018-12-08 14:01:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1744 transitions. [2018-12-08 14:01:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-08 14:01:02,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1421 states and 1747 transitions. [2018-12-08 14:01:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1747 transitions. [2018-12-08 14:01:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-08 14:01:04,505 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1424 states and 1750 transitions. [2018-12-08 14:01:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1750 transitions. [2018-12-08 14:01:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-08 14:01:05,200 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1427 states and 1753 transitions. [2018-12-08 14:01:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1753 transitions. [2018-12-08 14:01:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-08 14:01:05,922 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1447 states and 1776 transitions. [2018-12-08 14:01:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1776 transitions. [2018-12-08 14:01:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-08 14:01:08,956 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:09,144 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1467 states and 1798 transitions. [2018-12-08 14:01:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1798 transitions. [2018-12-08 14:01:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-08 14:01:12,131 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-08 14:01:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1537 states and 1872 transitions. [2018-12-08 14:01:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1872 transitions. [2018-12-08 14:01:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 14:01:13,459 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 14:01:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1541 states and 1879 transitions. [2018-12-08 14:01:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1879 transitions. [2018-12-08 14:01:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 14:01:17,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 14:01:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1544 states and 1883 transitions. [2018-12-08 14:01:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1883 transitions. [2018-12-08 14:01:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 14:01:19,057 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1553 states and 1896 transitions. [2018-12-08 14:01:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1896 transitions. [2018-12-08 14:01:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 14:01:22,041 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1565 states and 1911 transitions. [2018-12-08 14:01:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1911 transitions. [2018-12-08 14:01:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-08 14:01:23,862 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:01:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1582 states and 1927 transitions. [2018-12-08 14:01:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1927 transitions. [2018-12-08 14:01:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-08 14:01:25,262 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-08 14:01:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 1652 states and 2001 transitions. [2018-12-08 14:01:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2001 transitions. [2018-12-08 14:01:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-08 14:01:26,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 14:01:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 1684 states and 2040 transitions. [2018-12-08 14:01:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2040 transitions. [2018-12-08 14:01:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-08 14:01:34,941 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 14:01:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 1686 states and 2040 transitions. [2018-12-08 14:01:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2040 transitions. [2018-12-08 14:01:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-08 14:01:36,287 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:01:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1734 states and 2090 transitions. [2018-12-08 14:01:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2090 transitions. [2018-12-08 14:01:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-08 14:01:47,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:01:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 1777 states and 2134 transitions. [2018-12-08 14:01:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2134 transitions. [2018-12-08 14:01:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-08 14:01:54,871 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:01:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1781 states and 2137 transitions. [2018-12-08 14:01:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2137 transitions. [2018-12-08 14:01:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-08 14:01:57,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:01:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:01:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 1786 states and 2141 transitions. [2018-12-08 14:01:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2141 transitions. [2018-12-08 14:01:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-08 14:01:57,955 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:01:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:01:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:02:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1805 states and 2159 transitions. [2018-12-08 14:02:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2159 transitions. [2018-12-08 14:02:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-08 14:02:01,828 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-08 14:02:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 1874 states and 2231 transitions. [2018-12-08 14:02:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2231 transitions. [2018-12-08 14:02:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-08 14:02:02,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 199 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 14:02:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1876 states and 2232 transitions. [2018-12-08 14:02:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2232 transitions. [2018-12-08 14:02:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-08 14:02:03,490 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 14:02:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1887 states and 2246 transitions. [2018-12-08 14:02:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2246 transitions. [2018-12-08 14:02:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-08 14:02:05,906 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 14:02:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1904 states and 2262 transitions. [2018-12-08 14:02:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2262 transitions. [2018-12-08 14:02:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:07,666 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1961 states and 2330 transitions. [2018-12-08 14:02:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2330 transitions. [2018-12-08 14:02:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:13,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2001 states and 2386 transitions. [2018-12-08 14:02:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2386 transitions. [2018-12-08 14:02:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:22,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2017 states and 2401 transitions. [2018-12-08 14:02:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2401 transitions. [2018-12-08 14:02:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:23,122 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2048 states and 2437 transitions. [2018-12-08 14:02:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2437 transitions. [2018-12-08 14:02:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:27,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2072 states and 2468 transitions. [2018-12-08 14:02:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2468 transitions. [2018-12-08 14:02:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:29,224 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2088 states and 2484 transitions. [2018-12-08 14:02:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2484 transitions. [2018-12-08 14:02:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:29,825 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2112 states and 2508 transitions. [2018-12-08 14:02:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2508 transitions. [2018-12-08 14:02:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:31,566 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2137 states and 2543 transitions. [2018-12-08 14:02:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2543 transitions. [2018-12-08 14:02:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:35,768 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2159 states and 2568 transitions. [2018-12-08 14:02:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2568 transitions. [2018-12-08 14:02:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:36,773 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2161 states and 2570 transitions. [2018-12-08 14:02:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2570 transitions. [2018-12-08 14:02:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:37,436 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2163 states and 2571 transitions. [2018-12-08 14:02:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2571 transitions. [2018-12-08 14:02:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-08 14:02:37,990 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 14:02:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2170 states and 2584 transitions. [2018-12-08 14:02:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2584 transitions. [2018-12-08 14:02:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-08 14:02:39,047 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:02:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:02:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2179 states and 2599 transitions. [2018-12-08 14:02:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2599 transitions. [2018-12-08 14:02:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-08 14:02:46,951 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:02:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:02:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:03:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2230 states and 2655 transitions. [2018-12-08 14:03:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2655 transitions. [2018-12-08 14:03:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-08 14:03:00,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:03:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2232 states and 2657 transitions. [2018-12-08 14:03:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2657 transitions. [2018-12-08 14:03:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-08 14:03:02,662 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:03:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2234 states and 2659 transitions. [2018-12-08 14:03:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2659 transitions. [2018-12-08 14:03:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-08 14:03:05,402 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:03:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2239 states and 2663 transitions. [2018-12-08 14:03:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2663 transitions. [2018-12-08 14:03:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-08 14:03:06,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:03:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2258 states and 2683 transitions. [2018-12-08 14:03:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 2683 transitions. [2018-12-08 14:03:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-08 14:03:09,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 242 proven. 104 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:03:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2328 states and 2766 transitions. [2018-12-08 14:03:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2766 transitions. [2018-12-08 14:03:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-08 14:03:24,083 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 242 proven. 104 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:03:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2348 states and 2788 transitions. [2018-12-08 14:03:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 2788 transitions. [2018-12-08 14:03:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-08 14:03:26,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 242 proven. 104 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:03:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2383 states and 2824 transitions. [2018-12-08 14:03:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2824 transitions. [2018-12-08 14:03:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-08 14:03:30,832 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:03:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 14:03:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 14:03:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2400 states and 2842 transitions. [2018-12-08 14:03:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2842 transitions. [2018-12-08 14:03:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-08 14:03:35,412 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 14:03:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:03:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:03:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:03:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:03:35,584 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 126 iterations. [2018-12-08 14:03:35,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 02:03:35 ImpRootNode [2018-12-08 14:03:35,691 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 14:03:35,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:03:35,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:03:35,692 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:03:35,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:59:41" (3/4) ... [2018-12-08 14:03:35,693 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 14:03:35,779 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_70cb9f93-8c20-4827-9e01-ce4ed706e46b/bin-2019/ukojak/witness.graphml [2018-12-08 14:03:35,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:03:35,780 INFO L168 Benchmark]: Toolchain (without parser) took 235507.16 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 612.4 MB). Free memory was 946.3 MB in the beginning and 940.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 617.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:03:35,780 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:03:35,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-12-08 14:03:35,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.78 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 14:03:35,780 INFO L168 Benchmark]: Boogie Preprocessor took 29.65 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. [2018-12-08 14:03:35,781 INFO L168 Benchmark]: RCFGBuilder took 970.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.3 MB in the end (delta: 212.0 MB). Peak memory consumption was 212.0 MB. Max. memory is 11.5 GB. [2018-12-08 14:03:35,781 INFO L168 Benchmark]: CodeCheck took 234047.69 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 472.9 MB). Free memory was 903.3 MB in the beginning and 972.7 MB in the end (delta: -69.4 MB). Peak memory consumption was 403.5 MB. Max. memory is 11.5 GB. [2018-12-08 14:03:35,781 INFO L168 Benchmark]: Witness Printer took 87.76 ms. Allocated memory is still 1.6 GB. Free memory was 972.7 MB in the beginning and 940.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:03:35,782 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 233.9s OverallTime, 126 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 139984920 SDtfs, -513996014 SDslu, 876616908 SDs, 0 SdLazy, 1629453624 SolverSat, 849357986 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 377.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141664 GetRequests, 134661 SyntacticMatches, 5431 SemanticMatches, 1572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815229 ImplicationChecksByTransitivity, 214.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 21133 NumberOfCodeBlocks, 21133 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 20753 ConstructedInterpolants, 0 QuantifiedInterpolants, 30561826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 125 InterpolantComputations, 95 PerfectInterpolantSequences, 19196/19875 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 425]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND TRUE ((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))) [L383] a20 = 0 [L384] a21 = 1 [L385] a8 = 14 [L386] a17 = 0 [L387] a16 = 5 [L388] a7 = 1 [L389] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.78 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.65 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 970.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.3 MB in the end (delta: 212.0 MB). Peak memory consumption was 212.0 MB. Max. memory is 11.5 GB. * CodeCheck took 234047.69 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 472.9 MB). Free memory was 903.3 MB in the beginning and 972.7 MB in the end (delta: -69.4 MB). Peak memory consumption was 403.5 MB. Max. memory is 11.5 GB. * Witness Printer took 87.76 ms. Allocated memory is still 1.6 GB. Free memory was 972.7 MB in the beginning and 940.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...