./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/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 aaa39ce28677c06ea4974c4267a7bbc4385d14ab .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 19:25:52,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 19:25:52,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 19:25:52,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 19:25:52,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 19:25:52,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 19:25:52,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 19:25:52,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 19:25:52,195 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 19:25:52,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 19:25:52,196 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 19:25:52,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 19:25:52,197 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 19:25:52,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 19:25:52,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 19:25:52,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 19:25:52,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 19:25:52,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 19:25:52,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 19:25:52,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 19:25:52,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 19:25:52,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 19:25:52,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 19:25:52,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 19:25:52,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 19:25:52,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 19:25:52,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 19:25:52,211 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 19:25:52,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 19:25:52,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 19:25:52,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 19:25:52,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 19:25:52,213 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 19:25:52,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 19:25:52,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 19:25:52,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 19:25:52,214 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 19:25:52,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 19:25:52,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 19:25:52,226 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 19:25:52,226 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 19:25:52,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 19:25:52,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 19:25:52,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 19:25:52,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 19:25:52,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 19:25:52,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 19:25:52,228 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 19:25:52,229 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 19:25:52,229 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 19:25:52,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 19:25:52,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 19:25:52,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 19:25:52,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 19:25:52,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 19:25:52,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 19:25:52,230 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 19:25:52,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 19:25:52,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 19:25:52,230 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_0371a716-e3ce-416b-be4d-6682188339c7/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 -> aaa39ce28677c06ea4974c4267a7bbc4385d14ab [2018-11-18 19:25:52,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 19:25:52,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 19:25:52,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 19:25:52,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 19:25:52,271 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 19:25:52,271 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-18 19:25:52,322 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/data/1095a6f2b/af691d659ecb4029966630cda83f5fc8/FLAG6502e915e [2018-11-18 19:25:52,724 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 19:25:52,724 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-18 19:25:52,733 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/data/1095a6f2b/af691d659ecb4029966630cda83f5fc8/FLAG6502e915e [2018-11-18 19:25:52,745 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/data/1095a6f2b/af691d659ecb4029966630cda83f5fc8 [2018-11-18 19:25:52,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 19:25:52,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 19:25:52,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 19:25:52,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 19:25:52,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 19:25:52,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:25:52" (1/1) ... [2018-11-18 19:25:52,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6654e84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:52, skipping insertion in model container [2018-11-18 19:25:52,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:25:52" (1/1) ... [2018-11-18 19:25:52,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 19:25:52,826 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 19:25:53,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 19:25:53,157 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 19:25:53,229 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 19:25:53,242 INFO L195 MainTranslator]: Completed translation [2018-11-18 19:25:53,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53 WrapperNode [2018-11-18 19:25:53,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 19:25:53,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 19:25:53,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 19:25:53,243 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 19:25:53,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 19:25:53,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 19:25:53,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 19:25:53,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 19:25:53,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... [2018-11-18 19:25:53,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 19:25:53,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 19:25:53,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 19:25:53,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 19:25:53,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:25:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/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-11-18 19:25:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 19:25:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 19:25:53,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 19:25:56,421 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 19:25:56,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:25:56 BoogieIcfgContainer [2018-11-18 19:25:56,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 19:25:56,422 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 19:25:56,422 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 19:25:56,433 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 19:25:56,433 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:25:56" (1/1) ... [2018-11-18 19:25:56,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 19:25:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-18 19:25:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-18 19:25:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 19:25:56,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:25:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-11-18 19:25:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-11-18 19:25:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 19:25:57,179 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:25:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 152 states and 229 transitions. [2018-11-18 19:25:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2018-11-18 19:25:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 19:25:57,410 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:25:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 158 states and 240 transitions. [2018-11-18 19:25:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2018-11-18 19:25:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 19:25:57,573 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 19:25:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 236 states and 331 transitions. [2018-11-18 19:25:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2018-11-18 19:25:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 19:25:58,201 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 19:25:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 260 states and 362 transitions. [2018-11-18 19:25:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 362 transitions. [2018-11-18 19:25:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 19:25:58,542 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:25:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 271 states and 379 transitions. [2018-11-18 19:25:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 379 transitions. [2018-11-18 19:25:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 19:25:59,155 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 19:25:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 276 states and 384 transitions. [2018-11-18 19:25:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 384 transitions. [2018-11-18 19:25:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 19:25:59,210 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:25:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:25:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 288 states and 410 transitions. [2018-11-18 19:25:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 410 transitions. [2018-11-18 19:25:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 19:25:59,814 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:25:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:25:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 295 states and 421 transitions. [2018-11-18 19:26:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2018-11-18 19:26:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 19:26:00,156 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 299 states and 425 transitions. [2018-11-18 19:26:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 425 transitions. [2018-11-18 19:26:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 19:26:00,268 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 306 states and 432 transitions. [2018-11-18 19:26:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 432 transitions. [2018-11-18 19:26:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 19:26:00,620 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 312 states and 438 transitions. [2018-11-18 19:26:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 438 transitions. [2018-11-18 19:26:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 19:26:00,905 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 19:26:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 318 states and 444 transitions. [2018-11-18 19:26:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 444 transitions. [2018-11-18 19:26:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 19:26:00,972 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 320 states and 447 transitions. [2018-11-18 19:26:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 447 transitions. [2018-11-18 19:26:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 19:26:01,178 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 326 states and 457 transitions. [2018-11-18 19:26:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 457 transitions. [2018-11-18 19:26:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 19:26:01,665 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 329 states and 460 transitions. [2018-11-18 19:26:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2018-11-18 19:26:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 19:26:01,849 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 336 states and 469 transitions. [2018-11-18 19:26:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 469 transitions. [2018-11-18 19:26:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 19:26:02,169 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 341 states and 474 transitions. [2018-11-18 19:26:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 474 transitions. [2018-11-18 19:26:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 19:26:02,581 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 19:26:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 346 states and 482 transitions. [2018-11-18 19:26:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 482 transitions. [2018-11-18 19:26:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 19:26:02,988 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 19:26:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 353 states and 490 transitions. [2018-11-18 19:26:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 490 transitions. [2018-11-18 19:26:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 19:26:03,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 19:26:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 357 states and 494 transitions. [2018-11-18 19:26:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2018-11-18 19:26:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 19:26:03,417 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 363 states and 504 transitions. [2018-11-18 19:26:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 504 transitions. [2018-11-18 19:26:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 19:26:04,175 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 364 states and 504 transitions. [2018-11-18 19:26:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 504 transitions. [2018-11-18 19:26:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 19:26:04,424 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 19:26:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 378 states and 518 transitions. [2018-11-18 19:26:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2018-11-18 19:26:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 19:26:04,529 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 424 states and 568 transitions. [2018-11-18 19:26:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 568 transitions. [2018-11-18 19:26:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 19:26:05,254 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 433 states and 578 transitions. [2018-11-18 19:26:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 578 transitions. [2018-11-18 19:26:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-18 19:26:05,310 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 19:26:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 440 states and 586 transitions. [2018-11-18 19:26:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 586 transitions. [2018-11-18 19:26:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 19:26:05,412 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 454 states and 602 transitions. [2018-11-18 19:26:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 602 transitions. [2018-11-18 19:26:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 19:26:05,815 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 457 states and 605 transitions. [2018-11-18 19:26:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 605 transitions. [2018-11-18 19:26:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 19:26:05,866 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 471 states and 621 transitions. [2018-11-18 19:26:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 621 transitions. [2018-11-18 19:26:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 19:26:06,819 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 19:26:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 482 states and 642 transitions. [2018-11-18 19:26:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 642 transitions. [2018-11-18 19:26:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 19:26:07,475 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 19:26:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 486 states and 649 transitions. [2018-11-18 19:26:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 649 transitions. [2018-11-18 19:26:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 19:26:07,726 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 551 states and 716 transitions. [2018-11-18 19:26:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 716 transitions. [2018-11-18 19:26:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 19:26:09,246 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 19:26:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 552 states and 716 transitions. [2018-11-18 19:26:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 716 transitions. [2018-11-18 19:26:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 19:26:09,315 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 622 states and 799 transitions. [2018-11-18 19:26:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 799 transitions. [2018-11-18 19:26:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 19:26:11,967 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 626 states and 804 transitions. [2018-11-18 19:26:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 804 transitions. [2018-11-18 19:26:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 19:26:12,261 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 696 states and 879 transitions. [2018-11-18 19:26:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 879 transitions. [2018-11-18 19:26:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 19:26:13,144 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 19:26:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 697 states and 879 transitions. [2018-11-18 19:26:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 879 transitions. [2018-11-18 19:26:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 19:26:13,206 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 703 states and 890 transitions. [2018-11-18 19:26:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 890 transitions. [2018-11-18 19:26:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 19:26:13,880 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 709 states and 897 transitions. [2018-11-18 19:26:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 897 transitions. [2018-11-18 19:26:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 19:26:14,153 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 713 states and 902 transitions. [2018-11-18 19:26:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 902 transitions. [2018-11-18 19:26:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 19:26:14,405 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 19:26:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 726 states and 920 transitions. [2018-11-18 19:26:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 920 transitions. [2018-11-18 19:26:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 19:26:14,861 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 19:26:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 728 states and 922 transitions. [2018-11-18 19:26:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 922 transitions. [2018-11-18 19:26:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 19:26:14,921 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 19:26:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 737 states and 934 transitions. [2018-11-18 19:26:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-11-18 19:26:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 19:26:15,605 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 19:26:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 741 states and 939 transitions. [2018-11-18 19:26:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 939 transitions. [2018-11-18 19:26:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 19:26:15,836 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 110 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 19:26:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 760 states and 962 transitions. [2018-11-18 19:26:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 962 transitions. [2018-11-18 19:26:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 19:26:16,623 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 774 states and 979 transitions. [2018-11-18 19:26:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 979 transitions. [2018-11-18 19:26:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 19:26:18,038 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 19:26:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 776 states and 981 transitions. [2018-11-18 19:26:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 981 transitions. [2018-11-18 19:26:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 19:26:18,317 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 845 states and 1068 transitions. [2018-11-18 19:26:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1068 transitions. [2018-11-18 19:26:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 19:26:23,568 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 870 states and 1097 transitions. [2018-11-18 19:26:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1097 transitions. [2018-11-18 19:26:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 19:26:25,370 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 872 states and 1101 transitions. [2018-11-18 19:26:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1101 transitions. [2018-11-18 19:26:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 19:26:25,913 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 881 states and 1109 transitions. [2018-11-18 19:26:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1109 transitions. [2018-11-18 19:26:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 19:26:26,073 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 19:26:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 954 states and 1193 transitions. [2018-11-18 19:26:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1193 transitions. [2018-11-18 19:26:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 19:26:27,473 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 19:26:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 964 states and 1216 transitions. [2018-11-18 19:26:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1216 transitions. [2018-11-18 19:26:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 19:26:29,780 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 19:26:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 968 states and 1223 transitions. [2018-11-18 19:26:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1223 transitions. [2018-11-18 19:26:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 19:26:30,602 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 19:26:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 971 states and 1228 transitions. [2018-11-18 19:26:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1228 transitions. [2018-11-18 19:26:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 19:26:31,268 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 19:26:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 974 states and 1231 transitions. [2018-11-18 19:26:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1231 transitions. [2018-11-18 19:26:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-18 19:26:31,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 19:26:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1020 states and 1283 transitions. [2018-11-18 19:26:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1283 transitions. [2018-11-18 19:26:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 19:26:33,046 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 19:26:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1023 states and 1287 transitions. [2018-11-18 19:26:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1287 transitions. [2018-11-18 19:26:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-18 19:26:33,520 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 19:26:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1026 states and 1291 transitions. [2018-11-18 19:26:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1291 transitions. [2018-11-18 19:26:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 19:26:33,732 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1051 states and 1323 transitions. [2018-11-18 19:26:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1323 transitions. [2018-11-18 19:26:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 19:26:36,175 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 19:26:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1055 states and 1327 transitions. [2018-11-18 19:26:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1327 transitions. [2018-11-18 19:26:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 19:26:36,612 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 19:26:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1087 states and 1363 transitions. [2018-11-18 19:26:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1363 transitions. [2018-11-18 19:26:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 19:26:39,140 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 245 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 19:26:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1096 states and 1373 transitions. [2018-11-18 19:26:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1373 transitions. [2018-11-18 19:26:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 19:26:40,180 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 245 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 19:26:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1100 states and 1377 transitions. [2018-11-18 19:26:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1377 transitions. [2018-11-18 19:26:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 19:26:40,480 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 19:26:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1105 states and 1382 transitions. [2018-11-18 19:26:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1382 transitions. [2018-11-18 19:26:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 19:26:40,803 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:26:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1146 states and 1432 transitions. [2018-11-18 19:26:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1432 transitions. [2018-11-18 19:26:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 19:26:44,264 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:26:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1161 states and 1448 transitions. [2018-11-18 19:26:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1448 transitions. [2018-11-18 19:26:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-18 19:26:45,256 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:26:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1166 states and 1453 transitions. [2018-11-18 19:26:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1453 transitions. [2018-11-18 19:26:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 19:26:45,826 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 19:26:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1197 states and 1486 transitions. [2018-11-18 19:26:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1486 transitions. [2018-11-18 19:26:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 19:26:46,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-18 19:26:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1268 states and 1560 transitions. [2018-11-18 19:26:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1560 transitions. [2018-11-18 19:26:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-18 19:26:46,883 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 19:26:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1326 states and 1626 transitions. [2018-11-18 19:26:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1626 transitions. [2018-11-18 19:26:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-18 19:26:51,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 19:26:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1346 states and 1646 transitions. [2018-11-18 19:26:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1646 transitions. [2018-11-18 19:26:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 19:26:52,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 19:26:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1388 states and 1699 transitions. [2018-11-18 19:26:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1699 transitions. [2018-11-18 19:26:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 19:26:54,222 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 19:26:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1397 states and 1710 transitions. [2018-11-18 19:26:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1710 transitions. [2018-11-18 19:26:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 19:26:54,753 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 19:26:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1426 states and 1742 transitions. [2018-11-18 19:26:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1742 transitions. [2018-11-18 19:26:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 19:26:58,623 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:26:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 19:26:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:26:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1445 states and 1760 transitions. [2018-11-18 19:26:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1760 transitions. [2018-11-18 19:26:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 19:26:59,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:26:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-18 19:27:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1450 states and 1764 transitions. [2018-11-18 19:27:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1764 transitions. [2018-11-18 19:27:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 19:27:00,641 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-18 19:27:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1521 states and 1839 transitions. [2018-11-18 19:27:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1839 transitions. [2018-11-18 19:27:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 19:27:02,060 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-18 19:27:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1620 states and 1944 transitions. [2018-11-18 19:27:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1944 transitions. [2018-11-18 19:27:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-18 19:27:03,157 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 19:27:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1665 states and 1994 transitions. [2018-11-18 19:27:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1994 transitions. [2018-11-18 19:27:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-18 19:27:07,214 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 19:27:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1674 states and 2003 transitions. [2018-11-18 19:27:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2003 transitions. [2018-11-18 19:27:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-18 19:27:08,204 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 229 proven. 134 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 19:27:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 1721 states and 2062 transitions. [2018-11-18 19:27:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2062 transitions. [2018-11-18 19:27:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-18 19:27:11,087 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-18 19:27:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1742 states and 2082 transitions. [2018-11-18 19:27:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2082 transitions. [2018-11-18 19:27:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-18 19:27:11,321 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-11-18 19:27:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 1746 states and 2085 transitions. [2018-11-18 19:27:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2085 transitions. [2018-11-18 19:27:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-18 19:27:11,546 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 396 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 19:27:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1883 states and 2270 transitions. [2018-11-18 19:27:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2270 transitions. [2018-11-18 19:27:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-18 19:27:21,739 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:27:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 1892 states and 2283 transitions. [2018-11-18 19:27:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2283 transitions. [2018-11-18 19:27:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-18 19:27:24,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:27:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 1901 states and 2291 transitions. [2018-11-18 19:27:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2291 transitions. [2018-11-18 19:27:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-18 19:27:25,214 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 274 proven. 50 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:27:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 1914 states and 2311 transitions. [2018-11-18 19:27:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2311 transitions. [2018-11-18 19:27:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-18 19:27:28,875 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 274 proven. 50 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:27:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 1919 states and 2315 transitions. [2018-11-18 19:27:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2315 transitions. [2018-11-18 19:27:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-18 19:27:29,815 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:27:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 1956 states and 2363 transitions. [2018-11-18 19:27:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2363 transitions. [2018-11-18 19:27:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-18 19:27:35,305 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:27:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 1974 states and 2381 transitions. [2018-11-18 19:27:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2381 transitions. [2018-11-18 19:27:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-18 19:27:36,517 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:27:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2021 states and 2431 transitions. [2018-11-18 19:27:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2431 transitions. [2018-11-18 19:27:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-18 19:27:44,686 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:27:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2026 states and 2437 transitions. [2018-11-18 19:27:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2437 transitions. [2018-11-18 19:27:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-18 19:27:46,193 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:27:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2030 states and 2442 transitions. [2018-11-18 19:27:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2442 transitions. [2018-11-18 19:27:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-18 19:27:47,626 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:27:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2031 states and 2445 transitions. [2018-11-18 19:27:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2445 transitions. [2018-11-18 19:27:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-18 19:27:48,388 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 320 proven. 14 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-18 19:27:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2032 states and 2446 transitions. [2018-11-18 19:27:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2446 transitions. [2018-11-18 19:27:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-18 19:27:48,864 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 320 proven. 14 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-18 19:27:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2036 states and 2450 transitions. [2018-11-18 19:27:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2450 transitions. [2018-11-18 19:27:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-18 19:27:49,917 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:27:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:27:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2061 states and 2479 transitions. [2018-11-18 19:27:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2479 transitions. [2018-11-18 19:27:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-18 19:27:56,088 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:27:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:27:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:28:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:28:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2086 states and 2508 transitions. [2018-11-18 19:28:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2508 transitions. [2018-11-18 19:28:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-18 19:28:00,057 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:28:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:28:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:28:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:28:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2092 states and 2515 transitions. [2018-11-18 19:28:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2515 transitions. [2018-11-18 19:28:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-18 19:28:00,850 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:28:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:28:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 19:28:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:28:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2093 states and 2515 transitions. [2018-11-18 19:28:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2515 transitions. [2018-11-18 19:28:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-18 19:28:01,380 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:28:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:28:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:28:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:28:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2102 states and 2531 transitions. [2018-11-18 19:28:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2531 transitions. [2018-11-18 19:28:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-18 19:28:06,455 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:28:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:28:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:28:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:28:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2110 states and 2543 transitions. [2018-11-18 19:28:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2543 transitions. [2018-11-18 19:28:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-18 19:28:09,699 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:28:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:28:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:28:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:28:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2116 states and 2551 transitions. [2018-11-18 19:28:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2551 transitions. [2018-11-18 19:28:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-18 19:28:11,588 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:28:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 19:28:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 19:28:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 19:28:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2119 states and 2553 transitions. [2018-11-18 19:28:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2553 transitions. [2018-11-18 19:28:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-11-18 19:28:12,606 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 19:28:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 19:28:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 19:28:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 19:28:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 19:28:12,843 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 107 iterations. [2018-11-18 19:28:12,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 07:28:12 ImpRootNode [2018-11-18 19:28:12,987 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 19:28:12,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 19:28:12,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 19:28:12,987 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 19:28:12,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:25:56" (3/4) ... [2018-11-18 19:28:12,990 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 19:28:13,137 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0371a716-e3ce-416b-be4d-6682188339c7/bin-2019/ukojak/witness.graphml [2018-11-18 19:28:13,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 19:28:13,138 INFO L168 Benchmark]: Toolchain (without parser) took 140386.48 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 955.8 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 587.9 MB. Max. memory is 11.5 GB. [2018-11-18 19:28:13,139 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 19:28:13,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.47 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 918.3 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 19:28:13,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 918.3 MB in the beginning and 1.1 GB in the end (delta: -212.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-18 19:28:13,139 INFO L168 Benchmark]: Boogie Preprocessor took 65.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 19:28:13,140 INFO L168 Benchmark]: RCFGBuilder took 2991.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.3 MB in the end (delta: 233.6 MB). Peak memory consumption was 233.6 MB. Max. memory is 11.5 GB. [2018-11-18 19:28:13,140 INFO L168 Benchmark]: CodeCheck took 136564.72 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 893.3 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 324.8 MB. Max. memory is 11.5 GB. [2018-11-18 19:28:13,140 INFO L168 Benchmark]: Witness Printer took 149.94 ms. Allocated memory is still 3.9 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2018-11-18 19:28:13,142 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, 199 locations, 1 error locations. UNSAFE Result, 136.3s OverallTime, 107 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1365206424 SDtfs, -541513266 SDslu, -1755750552 SDs, 0 SdLazy, -387008570 SolverSat, 282100080 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 284.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129474 GetRequests, 124264 SyntacticMatches, 3826 SemanticMatches, 1384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341493 ImplicationChecksByTransitivity, 120.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 19964 NumberOfCodeBlocks, 19964 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 19568 ConstructedInterpolants, 0 QuantifiedInterpolants, 28622694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 76 PerfectInterpolantSequences, 21940/22782 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: 392]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] RET return 25; VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L239] a20 = 0 [L240] a21 = 1 [L241] a17 = 0 [L242] a8 = 14 [L243] a16 = 4 [L244] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.47 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 918.3 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 918.3 MB in the beginning and 1.1 GB in the end (delta: -212.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2991.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.3 MB in the end (delta: 233.6 MB). Peak memory consumption was 233.6 MB. Max. memory is 11.5 GB. * CodeCheck took 136564.72 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 893.3 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 324.8 MB. Max. memory is 11.5 GB. * Witness Printer took 149.94 ms. Allocated memory is still 3.9 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...