./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/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 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-10-27 01:02:06,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 01:02:06,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 01:02:06,806 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 01:02:06,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 01:02:06,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 01:02:06,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 01:02:06,811 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 01:02:06,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 01:02:06,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 01:02:06,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 01:02:06,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 01:02:06,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 01:02:06,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 01:02:06,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 01:02:06,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 01:02:06,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 01:02:06,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 01:02:06,829 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 01:02:06,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 01:02:06,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 01:02:06,832 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 01:02:06,833 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 01:02:06,833 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 01:02:06,833 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 01:02:06,834 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 01:02:06,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 01:02:06,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 01:02:06,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 01:02:06,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 01:02:06,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 01:02:06,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 01:02:06,841 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 01:02:06,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 01:02:06,842 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 01:02:06,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 01:02:06,843 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-27 01:02:06,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 01:02:06,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 01:02:06,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 01:02:06,859 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 01:02:06,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 01:02:06,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 01:02:06,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 01:02:06,862 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 01:02:06,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 01:02:06,862 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 01:02:06,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 01:02:06,862 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 01:02:06,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 01:02:06,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 01:02:06,863 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 01:02:06,864 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 01:02:06,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 01:02:06,864 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-27 01:02:06,864 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-27 01:02:06,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 01:02:06,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 01:02:06,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-27 01:02:06,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 01:02:06,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 01:02:06,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 01:02:06,865 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-27 01:02:06,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 01:02:06,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 01:02:06,865 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_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/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 -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2018-10-27 01:02:06,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 01:02:06,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 01:02:06,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 01:02:06,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 01:02:06,921 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 01:02:06,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-10-27 01:02:06,968 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/data/2cc37aa7f/e2d29bfdb9cc46f399450688b5ca670f/FLAGee6be2b2e [2018-10-27 01:02:07,405 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 01:02:07,406 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-10-27 01:02:07,415 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/data/2cc37aa7f/e2d29bfdb9cc46f399450688b5ca670f/FLAGee6be2b2e [2018-10-27 01:02:07,428 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/data/2cc37aa7f/e2d29bfdb9cc46f399450688b5ca670f [2018-10-27 01:02:07,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 01:02:07,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 01:02:07,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 01:02:07,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 01:02:07,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 01:02:07,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:07,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229bb957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07, skipping insertion in model container [2018-10-27 01:02:07,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:07,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 01:02:07,507 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 01:02:07,835 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:02:07,838 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 01:02:07,925 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:02:07,944 INFO L193 MainTranslator]: Completed translation [2018-10-27 01:02:07,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07 WrapperNode [2018-10-27 01:02:07,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 01:02:07,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 01:02:07,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 01:02:07,946 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 01:02:07,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:07,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 01:02:08,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 01:02:08,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 01:02:08,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 01:02:08,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... [2018-10-27 01:02:08,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 01:02:08,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 01:02:08,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 01:02:08,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 01:02:08,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:02:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/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-10-27 01:02:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 01:02:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 01:02:08,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 01:02:12,481 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 01:02:12,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:02:12 BoogieIcfgContainer [2018-10-27 01:02:12,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 01:02:12,483 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-27 01:02:12,483 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-27 01:02:12,491 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-27 01:02:12,492 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:02:12" (1/1) ... [2018-10-27 01:02:12,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:02:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-10-27 01:02:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-10-27 01:02:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-27 01:02:12,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 165 states and 278 transitions. [2018-10-27 01:02:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 278 transitions. [2018-10-27 01:02:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-27 01:02:13,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 245 states and 362 transitions. [2018-10-27 01:02:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 362 transitions. [2018-10-27 01:02:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 01:02:14,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 250 states and 369 transitions. [2018-10-27 01:02:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2018-10-27 01:02:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 01:02:15,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 330 states and 452 transitions. [2018-10-27 01:02:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 452 transitions. [2018-10-27 01:02:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 01:02:16,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 358 states and 485 transitions. [2018-10-27 01:02:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 485 transitions. [2018-10-27 01:02:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 01:02:16,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 436 states and 570 transitions. [2018-10-27 01:02:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 570 transitions. [2018-10-27 01:02:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 01:02:17,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:18,037 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 01:02:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 460 states and 595 transitions. [2018-10-27 01:02:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 595 transitions. [2018-10-27 01:02:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 01:02:18,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 464 states and 599 transitions. [2018-10-27 01:02:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 599 transitions. [2018-10-27 01:02:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 01:02:18,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 497 states and 640 transitions. [2018-10-27 01:02:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 640 transitions. [2018-10-27 01:02:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-27 01:02:19,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:02:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 498 states and 642 transitions. [2018-10-27 01:02:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 642 transitions. [2018-10-27 01:02:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-27 01:02:19,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:02:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 502 states and 646 transitions. [2018-10-27 01:02:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 646 transitions. [2018-10-27 01:02:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-27 01:02:19,733 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:20,568 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 01:02:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 539 states and 693 transitions. [2018-10-27 01:02:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 693 transitions. [2018-10-27 01:02:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 01:02:21,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:02:22,288 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 01:02:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 544 states and 699 transitions. [2018-10-27 01:02:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 699 transitions. [2018-10-27 01:02:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-27 01:02:23,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 549 states and 704 transitions. [2018-10-27 01:02:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 704 transitions. [2018-10-27 01:02:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-27 01:02:23,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-27 01:02:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 561 states and 723 transitions. [2018-10-27 01:02:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 723 transitions. [2018-10-27 01:02:23,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-27 01:02:23,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 581 states and 746 transitions. [2018-10-27 01:02:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 746 transitions. [2018-10-27 01:02:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 01:02:24,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 582 states and 747 transitions. [2018-10-27 01:02:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 747 transitions. [2018-10-27 01:02:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-27 01:02:24,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:02:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 596 states and 762 transitions. [2018-10-27 01:02:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 762 transitions. [2018-10-27 01:02:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 01:02:25,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 646 states and 817 transitions. [2018-10-27 01:02:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2018-10-27 01:02:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 01:02:25,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 01:02:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 650 states and 823 transitions. [2018-10-27 01:02:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 823 transitions. [2018-10-27 01:02:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 01:02:26,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 01:02:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 679 states and 855 transitions. [2018-10-27 01:02:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 855 transitions. [2018-10-27 01:02:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-27 01:02:26,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 693 states and 869 transitions. [2018-10-27 01:02:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 869 transitions. [2018-10-27 01:02:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-27 01:02:27,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 723 states and 901 transitions. [2018-10-27 01:02:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 901 transitions. [2018-10-27 01:02:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-27 01:02:27,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 790 states and 976 transitions. [2018-10-27 01:02:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 976 transitions. [2018-10-27 01:02:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 01:02:28,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 01:02:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 796 states and 983 transitions. [2018-10-27 01:02:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 983 transitions. [2018-10-27 01:02:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 01:02:29,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 845 states and 1036 transitions. [2018-10-27 01:02:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1036 transitions. [2018-10-27 01:02:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 01:02:29,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 849 states and 1040 transitions. [2018-10-27 01:02:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1040 transitions. [2018-10-27 01:02:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 01:02:30,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 01:02:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 854 states and 1055 transitions. [2018-10-27 01:02:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1055 transitions. [2018-10-27 01:02:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 01:02:32,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 874 states and 1078 transitions. [2018-10-27 01:02:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1078 transitions. [2018-10-27 01:02:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 01:02:33,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 01:02:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 889 states and 1094 transitions. [2018-10-27 01:02:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1094 transitions. [2018-10-27 01:02:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 01:02:33,956 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:34,525 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 01:02:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 903 states and 1109 transitions. [2018-10-27 01:02:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1109 transitions. [2018-10-27 01:02:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 01:02:35,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 907 states and 1116 transitions. [2018-10-27 01:02:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1116 transitions. [2018-10-27 01:02:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 01:02:35,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 908 states and 1118 transitions. [2018-10-27 01:02:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1118 transitions. [2018-10-27 01:02:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 01:02:36,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 909 states and 1119 transitions. [2018-10-27 01:02:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1119 transitions. [2018-10-27 01:02:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-27 01:02:36,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 01:02:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 930 states and 1140 transitions. [2018-10-27 01:02:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1140 transitions. [2018-10-27 01:02:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-27 01:02:36,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-27 01:02:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 931 states and 1142 transitions. [2018-10-27 01:02:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1142 transitions. [2018-10-27 01:02:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-27 01:02:36,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-27 01:02:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 942 states and 1162 transitions. [2018-10-27 01:02:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1162 transitions. [2018-10-27 01:02:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-27 01:02:37,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-27 01:02:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 957 states and 1178 transitions. [2018-10-27 01:02:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1178 transitions. [2018-10-27 01:02:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-27 01:02:37,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 970 states and 1193 transitions. [2018-10-27 01:02:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1193 transitions. [2018-10-27 01:02:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-27 01:02:37,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 975 states and 1197 transitions. [2018-10-27 01:02:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1197 transitions. [2018-10-27 01:02:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 01:02:38,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 01:02:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1062 states and 1289 transitions. [2018-10-27 01:02:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1289 transitions. [2018-10-27 01:02:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-27 01:02:40,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 01:02:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1089 states and 1317 transitions. [2018-10-27 01:02:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1317 transitions. [2018-10-27 01:02:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-27 01:02:41,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 01:02:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1090 states and 1318 transitions. [2018-10-27 01:02:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1318 transitions. [2018-10-27 01:02:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-27 01:02:42,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 01:02:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1094 states and 1322 transitions. [2018-10-27 01:02:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1322 transitions. [2018-10-27 01:02:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-27 01:02:42,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1112 states and 1341 transitions. [2018-10-27 01:02:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1341 transitions. [2018-10-27 01:02:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-27 01:02:43,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:02:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1116 states and 1344 transitions. [2018-10-27 01:02:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1344 transitions. [2018-10-27 01:02:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-27 01:02:43,791 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 01:02:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1136 states and 1367 transitions. [2018-10-27 01:02:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1367 transitions. [2018-10-27 01:02:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-27 01:02:44,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 01:02:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1161 states and 1394 transitions. [2018-10-27 01:02:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1394 transitions. [2018-10-27 01:02:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-27 01:02:45,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 171 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 01:02:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1172 states and 1409 transitions. [2018-10-27 01:02:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1409 transitions. [2018-10-27 01:02:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 01:02:46,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1189 states and 1432 transitions. [2018-10-27 01:02:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1432 transitions. [2018-10-27 01:02:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 01:02:47,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1193 states and 1436 transitions. [2018-10-27 01:02:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1436 transitions. [2018-10-27 01:02:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 01:02:47,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 01:02:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1212 states and 1456 transitions. [2018-10-27 01:02:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1456 transitions. [2018-10-27 01:02:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-27 01:02:48,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 01:02:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1224 states and 1467 transitions. [2018-10-27 01:02:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1467 transitions. [2018-10-27 01:02:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-27 01:02:49,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-10-27 01:02:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1225 states and 1467 transitions. [2018-10-27 01:02:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1467 transitions. [2018-10-27 01:02:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-27 01:02:49,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 01:02:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1231 states and 1474 transitions. [2018-10-27 01:02:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1474 transitions. [2018-10-27 01:02:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-27 01:02:49,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 01:02:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1264 states and 1507 transitions. [2018-10-27 01:02:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1507 transitions. [2018-10-27 01:02:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-27 01:02:49,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 01:02:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1364 states and 1608 transitions. [2018-10-27 01:02:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1608 transitions. [2018-10-27 01:02:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-27 01:02:53,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:02:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1406 states and 1651 transitions. [2018-10-27 01:02:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1651 transitions. [2018-10-27 01:02:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-27 01:02:54,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-27 01:02:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1435 states and 1683 transitions. [2018-10-27 01:02:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1683 transitions. [2018-10-27 01:02:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-27 01:02:55,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 01:02:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1469 states and 1718 transitions. [2018-10-27 01:02:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1718 transitions. [2018-10-27 01:02:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-27 01:02:55,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 01:02:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1479 states and 1730 transitions. [2018-10-27 01:02:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1730 transitions. [2018-10-27 01:02:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 01:02:56,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 01:02:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:02:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1481 states and 1733 transitions. [2018-10-27 01:02:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1733 transitions. [2018-10-27 01:02:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-27 01:02:57,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:02:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 01:03:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1581 states and 1835 transitions. [2018-10-27 01:03:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1835 transitions. [2018-10-27 01:03:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-27 01:03:03,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-27 01:03:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1625 states and 1885 transitions. [2018-10-27 01:03:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1885 transitions. [2018-10-27 01:03:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-27 01:03:04,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 01:03:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1644 states and 1904 transitions. [2018-10-27 01:03:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1904 transitions. [2018-10-27 01:03:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-27 01:03:05,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 01:03:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1647 states and 1906 transitions. [2018-10-27 01:03:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1906 transitions. [2018-10-27 01:03:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 01:03:06,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 01:03:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1675 states and 1939 transitions. [2018-10-27 01:03:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1939 transitions. [2018-10-27 01:03:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 01:03:07,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-27 01:03:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1679 states and 1943 transitions. [2018-10-27 01:03:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1943 transitions. [2018-10-27 01:03:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 01:03:07,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-27 01:03:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1680 states and 1943 transitions. [2018-10-27 01:03:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 1943 transitions. [2018-10-27 01:03:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 01:03:07,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 01:03:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1684 states and 1947 transitions. [2018-10-27 01:03:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 1947 transitions. [2018-10-27 01:03:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 01:03:08,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-27 01:03:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1708 states and 1972 transitions. [2018-10-27 01:03:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1972 transitions. [2018-10-27 01:03:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 01:03:08,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 01:03:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1723 states and 1987 transitions. [2018-10-27 01:03:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 1987 transitions. [2018-10-27 01:03:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-27 01:03:08,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 01:03:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1730 states and 1994 transitions. [2018-10-27 01:03:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 1994 transitions. [2018-10-27 01:03:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-27 01:03:09,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:03:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1731 states and 1998 transitions. [2018-10-27 01:03:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 1998 transitions. [2018-10-27 01:03:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-27 01:03:09,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:03:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1735 states and 2003 transitions. [2018-10-27 01:03:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2003 transitions. [2018-10-27 01:03:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-27 01:03:09,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 01:03:13,233 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-10-27 01:03:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1828 states and 2097 transitions. [2018-10-27 01:03:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2097 transitions. [2018-10-27 01:03:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-27 01:03:15,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 221 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 1878 states and 2154 transitions. [2018-10-27 01:03:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2154 transitions. [2018-10-27 01:03:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-27 01:03:18,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 01:03:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1884 states and 2159 transitions. [2018-10-27 01:03:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2159 transitions. [2018-10-27 01:03:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 01:03:18,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-27 01:03:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1937 states and 2222 transitions. [2018-10-27 01:03:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2222 transitions. [2018-10-27 01:03:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 01:03:20,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-27 01:03:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 1938 states and 2223 transitions. [2018-10-27 01:03:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2223 transitions. [2018-10-27 01:03:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 01:03:21,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-27 01:03:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 1948 states and 2231 transitions. [2018-10-27 01:03:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2231 transitions. [2018-10-27 01:03:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 01:03:21,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-27 01:03:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 1952 states and 2235 transitions. [2018-10-27 01:03:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2235 transitions. [2018-10-27 01:03:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-27 01:03:22,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-27 01:03:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1987 states and 2276 transitions. [2018-10-27 01:03:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2276 transitions. [2018-10-27 01:03:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-27 01:03:23,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-27 01:03:25,581 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-10-27 01:03:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2045 states and 2334 transitions. [2018-10-27 01:03:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2334 transitions. [2018-10-27 01:03:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-27 01:03:25,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-27 01:03:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2012 states and 2300 transitions. [2018-10-27 01:03:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2300 transitions. [2018-10-27 01:03:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 01:03:26,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-27 01:03:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2022 states and 2309 transitions. [2018-10-27 01:03:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2309 transitions. [2018-10-27 01:03:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 01:03:26,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-27 01:03:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 01:03:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2026 states and 2313 transitions. [2018-10-27 01:03:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2313 transitions. [2018-10-27 01:03:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-27 01:03:26,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 01:03:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:03:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:03:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:03:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:03:27,171 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 88 iterations. [2018-10-27 01:03:27,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 27.10 01:03:27 ImpRootNode [2018-10-27 01:03:27,359 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-27 01:03:27,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:03:27,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:03:27,359 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:03:27,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:02:12" (3/4) ... [2018-10-27 01:03:27,370 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 01:03:27,633 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a7775b62-e17a-4ecf-ae43-7f7e2e9512d4/bin-2019/ukojak/witness.graphml [2018-10-27 01:03:27,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:03:27,633 INFO L168 Benchmark]: Toolchain (without parser) took 80202.07 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 957.1 MB in the beginning and 1.5 GB in the end (delta: -548.5 MB). Peak memory consumption was 880.2 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:27,634 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:03:27,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 924.9 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:27,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 1.0 GB. Free memory was 924.9 MB in the beginning and 919.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:27,635 INFO L168 Benchmark]: Boogie Preprocessor took 160.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 919.6 MB in the beginning and 1.2 GB in the end (delta: -259.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:27,638 INFO L168 Benchmark]: RCFGBuilder took 4308.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 932.2 MB in the end (delta: 247.0 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:27,638 INFO L168 Benchmark]: CodeCheck took 74875.95 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 932.2 MB in the beginning and 1.5 GB in the end (delta: -603.2 MB). Peak memory consumption was 632.5 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:27,639 INFO L168 Benchmark]: Witness Printer took 273.70 ms. Allocated memory is still 2.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:27,641 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, 228 locations, 1 error locations. UNSAFE Result, 74.6s OverallTime, 88 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -938969724 SDtfs, 841429062 SDslu, -1203939940 SDs, 0 SdLazy, -1993777194 SolverSat, 97200312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 411.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99352 GetRequests, 97579 SyntacticMatches, 941 SemanticMatches, 832 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497383 ImplicationChecksByTransitivity, 58.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 15254 NumberOfCodeBlocks, 15254 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 14935 ConstructedInterpolants, 0 QuantifiedInterpolants, 8440833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 73 PerfectInterpolantSequences, 11398/11486 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: 421]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] RET return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] RET return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L155] a25 = 1 [L156] a19 = 1 [L157] a28 = 7 [L158] RET return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] __VERIFIER_error() VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 511.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 924.9 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 1.0 GB. Free memory was 924.9 MB in the beginning and 919.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 160.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 919.6 MB in the beginning and 1.2 GB in the end (delta: -259.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4308.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 932.2 MB in the end (delta: 247.0 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. * CodeCheck took 74875.95 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 932.2 MB in the beginning and 1.5 GB in the end (delta: -603.2 MB). Peak memory consumption was 632.5 MB. Max. memory is 11.5 GB. * Witness Printer took 273.70 ms. Allocated memory is still 2.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...