./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/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 fa966b8d35f41797c67ed2115fa88ccdba9ca513 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:14:00,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:14:00,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:14:00,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:14:00,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:14:00,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:14:00,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:14:00,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:14:00,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:14:00,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:14:00,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:14:00,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:14:00,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:14:00,410 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:14:00,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:14:00,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:14:00,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:14:00,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:14:00,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:14:00,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:14:00,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:14:00,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:14:00,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:14:00,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:14:00,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:14:00,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:14:00,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:14:00,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:14:00,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:14:00,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:14:00,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:14:00,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:14:00,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:14:00,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:14:00,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:14:00,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:14:00,430 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 19:14:00,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:14:00,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:14:00,443 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:14:00,443 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:14:00,444 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:14:00,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:14:00,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:14:00,444 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:14:00,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:14:00,445 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:14:00,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:14:00,445 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:14:00,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:14:00,445 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:14:00,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:14:00,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:14:00,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:14:00,446 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 19:14:00,446 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 19:14:00,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:14:00,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:14:00,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 19:14:00,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:14:00,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:14:00,449 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:14:00,449 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 19:14:00,449 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:14:00,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:14:00,450 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_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/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 -> fa966b8d35f41797c67ed2115fa88ccdba9ca513 [2018-10-26 19:14:00,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:14:00,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:14:00,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:14:00,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:14:00,504 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:14:00,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-10-26 19:14:00,553 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/data/c45ddf245/2d19ba4e69eb4cf3a34a30b6f79f726a/FLAGbe9b80cf7 [2018-10-26 19:14:01,058 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:14:01,058 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-10-26 19:14:01,070 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/data/c45ddf245/2d19ba4e69eb4cf3a34a30b6f79f726a/FLAGbe9b80cf7 [2018-10-26 19:14:01,081 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/data/c45ddf245/2d19ba4e69eb4cf3a34a30b6f79f726a [2018-10-26 19:14:01,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:14:01,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:14:01,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:14:01,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:14:01,090 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:14:01,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40893eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01, skipping insertion in model container [2018-10-26 19:14:01,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:14:01,150 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:14:01,489 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:14:01,498 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:14:01,591 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:14:01,614 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:14:01,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01 WrapperNode [2018-10-26 19:14:01,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:14:01,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:14:01,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:14:01,615 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:14:01,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:14:01,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:14:01,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:14:01,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:14:01,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... [2018-10-26 19:14:01,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:14:01,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:14:01,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:14:01,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:14:01,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:14:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 19:14:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:14:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:14:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:14:05,744 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:14:05,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:14:05 BoogieIcfgContainer [2018-10-26 19:14:05,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:14:05,746 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 19:14:05,746 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 19:14:05,756 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 19:14:05,757 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:14:05" (1/1) ... [2018-10-26 19:14:05,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-10-26 19:14:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-10-26 19:14:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 19:14:05,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 147 states and 222 transitions. [2018-10-26 19:14:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-10-26 19:14:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 19:14:06,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:14:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 148 states and 223 transitions. [2018-10-26 19:14:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2018-10-26 19:14:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 19:14:07,425 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 154 states and 233 transitions. [2018-10-26 19:14:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 233 transitions. [2018-10-26 19:14:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:14:08,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 225 states and 320 transitions. [2018-10-26 19:14:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 320 transitions. [2018-10-26 19:14:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-26 19:14:09,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:09,618 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 19:14:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 236 states and 338 transitions. [2018-10-26 19:14:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 338 transitions. [2018-10-26 19:14:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 19:14:10,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 248 states and 356 transitions. [2018-10-26 19:14:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 356 transitions. [2018-10-26 19:14:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 19:14:11,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 252 states and 360 transitions. [2018-10-26 19:14:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 360 transitions. [2018-10-26 19:14:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 19:14:11,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:11,628 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 19:14:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 254 states and 361 transitions. [2018-10-26 19:14:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 361 transitions. [2018-10-26 19:14:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 19:14:11,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:14:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 266 states and 376 transitions. [2018-10-26 19:14:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2018-10-26 19:14:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-26 19:14:12,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 272 states and 382 transitions. [2018-10-26 19:14:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 382 transitions. [2018-10-26 19:14:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 19:14:12,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:14:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 280 states and 391 transitions. [2018-10-26 19:14:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 391 transitions. [2018-10-26 19:14:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 19:14:13,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 285 states and 397 transitions. [2018-10-26 19:14:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 397 transitions. [2018-10-26 19:14:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 19:14:14,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:14,864 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:14:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 304 states and 419 transitions. [2018-10-26 19:14:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 419 transitions. [2018-10-26 19:14:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-26 19:14:15,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 310 states and 430 transitions. [2018-10-26 19:14:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 430 transitions. [2018-10-26 19:14:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-26 19:14:16,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:16,769 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-26 19:14:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 311 states and 430 transitions. [2018-10-26 19:14:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 430 transitions. [2018-10-26 19:14:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 19:14:16,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:14:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 342 states and 466 transitions. [2018-10-26 19:14:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 466 transitions. [2018-10-26 19:14:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 19:14:18,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 358 states and 484 transitions. [2018-10-26 19:14:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 484 transitions. [2018-10-26 19:14:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-26 19:14:18,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 372 states and 499 transitions. [2018-10-26 19:14:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 499 transitions. [2018-10-26 19:14:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 19:14:19,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 375 states and 503 transitions. [2018-10-26 19:14:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 503 transitions. [2018-10-26 19:14:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 19:14:19,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 389 states and 519 transitions. [2018-10-26 19:14:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 519 transitions. [2018-10-26 19:14:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:14:20,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:14:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 401 states and 539 transitions. [2018-10-26 19:14:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 539 transitions. [2018-10-26 19:14:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 19:14:20,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:14:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 407 states and 547 transitions. [2018-10-26 19:14:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 547 transitions. [2018-10-26 19:14:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 19:14:21,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 415 states and 561 transitions. [2018-10-26 19:14:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 561 transitions. [2018-10-26 19:14:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 19:14:22,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:23,416 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-26 19:14:24,295 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-10-26 19:14:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 417 states and 563 transitions. [2018-10-26 19:14:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 563 transitions. [2018-10-26 19:14:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 19:14:25,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 431 states and 579 transitions. [2018-10-26 19:14:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 579 transitions. [2018-10-26 19:14:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 19:14:25,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 19:14:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 440 states and 588 transitions. [2018-10-26 19:14:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 588 transitions. [2018-10-26 19:14:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 19:14:25,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 19:14:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 442 states and 590 transitions. [2018-10-26 19:14:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 590 transitions. [2018-10-26 19:14:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 19:14:26,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 487 states and 648 transitions. [2018-10-26 19:14:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 648 transitions. [2018-10-26 19:14:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 19:14:28,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 492 states and 653 transitions. [2018-10-26 19:14:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 653 transitions. [2018-10-26 19:14:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 19:14:29,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 533 states and 697 transitions. [2018-10-26 19:14:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 697 transitions. [2018-10-26 19:14:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 19:14:30,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:14:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 555 states and 723 transitions. [2018-10-26 19:14:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 723 transitions. [2018-10-26 19:14:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 19:14:30,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 19:14:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 557 states and 726 transitions. [2018-10-26 19:14:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 726 transitions. [2018-10-26 19:14:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 19:14:31,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 19:14:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 564 states and 734 transitions. [2018-10-26 19:14:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 734 transitions. [2018-10-26 19:14:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 19:14:31,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 603 states and 782 transitions. [2018-10-26 19:14:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 782 transitions. [2018-10-26 19:14:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 19:14:33,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 668 states and 849 transitions. [2018-10-26 19:14:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 849 transitions. [2018-10-26 19:14:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 19:14:36,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 19:14:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 682 states and 862 transitions. [2018-10-26 19:14:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 862 transitions. [2018-10-26 19:14:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 19:14:36,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 19:14:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 686 states and 865 transitions. [2018-10-26 19:14:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 865 transitions. [2018-10-26 19:14:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 19:14:37,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:39,024 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-10-26 19:14:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 725 states and 916 transitions. [2018-10-26 19:14:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2018-10-26 19:14:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 19:14:39,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 756 states and 946 transitions. [2018-10-26 19:14:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 946 transitions. [2018-10-26 19:14:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 19:14:40,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:14:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 774 states and 964 transitions. [2018-10-26 19:14:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 964 transitions. [2018-10-26 19:14:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 19:14:40,315 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:14:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 776 states and 966 transitions. [2018-10-26 19:14:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 966 transitions. [2018-10-26 19:14:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 19:14:40,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 777 states and 968 transitions. [2018-10-26 19:14:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 968 transitions. [2018-10-26 19:14:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 19:14:40,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 19:14:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 783 states and 975 transitions. [2018-10-26 19:14:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 975 transitions. [2018-10-26 19:14:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 19:14:41,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 19:14:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 784 states and 975 transitions. [2018-10-26 19:14:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 975 transitions. [2018-10-26 19:14:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 19:14:41,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 19:14:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 798 states and 992 transitions. [2018-10-26 19:14:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 992 transitions. [2018-10-26 19:14:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 19:14:42,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 19:14:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 804 states and 997 transitions. [2018-10-26 19:14:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 997 transitions. [2018-10-26 19:14:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 19:14:42,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 19:14:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 824 states and 1020 transitions. [2018-10-26 19:14:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1020 transitions. [2018-10-26 19:14:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 19:14:43,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 19:14:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 831 states and 1028 transitions. [2018-10-26 19:14:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1028 transitions. [2018-10-26 19:14:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 19:14:44,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 19:14:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 835 states and 1033 transitions. [2018-10-26 19:14:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1033 transitions. [2018-10-26 19:14:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 19:14:44,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 150 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 19:14:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 852 states and 1053 transitions. [2018-10-26 19:14:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1053 transitions. [2018-10-26 19:14:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 19:14:45,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 226 proven. 10 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-26 19:14:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 866 states and 1072 transitions. [2018-10-26 19:14:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1072 transitions. [2018-10-26 19:14:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 19:14:47,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-26 19:14:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 868 states and 1074 transitions. [2018-10-26 19:14:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1074 transitions. [2018-10-26 19:14:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-26 19:14:47,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 165 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 19:14:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 938 states and 1150 transitions. [2018-10-26 19:14:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1150 transitions. [2018-10-26 19:14:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 19:14:49,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-26 19:14:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 951 states and 1165 transitions. [2018-10-26 19:14:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1165 transitions. [2018-10-26 19:14:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-26 19:14:49,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 19:14:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 954 states and 1168 transitions. [2018-10-26 19:14:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1168 transitions. [2018-10-26 19:14:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 19:14:50,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-26 19:14:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 985 states and 1202 transitions. [2018-10-26 19:14:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1202 transitions. [2018-10-26 19:14:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 19:14:51,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-26 19:14:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 993 states and 1208 transitions. [2018-10-26 19:14:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1208 transitions. [2018-10-26 19:14:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-26 19:14:51,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 215 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 19:14:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1024 states and 1247 transitions. [2018-10-26 19:14:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1247 transitions. [2018-10-26 19:14:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 19:14:54,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 342 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 19:14:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1042 states and 1267 transitions. [2018-10-26 19:14:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1267 transitions. [2018-10-26 19:14:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 19:14:56,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 342 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 19:14:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1046 states and 1271 transitions. [2018-10-26 19:14:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1271 transitions. [2018-10-26 19:14:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-26 19:14:56,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 19:14:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:14:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1078 states and 1315 transitions. [2018-10-26 19:14:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1315 transitions. [2018-10-26 19:14:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-26 19:14:59,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:14:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 19:15:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1094 states and 1334 transitions. [2018-10-26 19:15:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1334 transitions. [2018-10-26 19:15:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-26 19:15:01,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 19:15:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1110 states and 1358 transitions. [2018-10-26 19:15:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1358 transitions. [2018-10-26 19:15:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-26 19:15:02,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 19:15:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1120 states and 1369 transitions. [2018-10-26 19:15:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1369 transitions. [2018-10-26 19:15:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-26 19:15:03,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-26 19:15:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1169 states and 1427 transitions. [2018-10-26 19:15:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1427 transitions. [2018-10-26 19:15:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-26 19:15:06,173 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-26 19:15:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1191 states and 1451 transitions. [2018-10-26 19:15:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1451 transitions. [2018-10-26 19:15:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 19:15:07,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 324 proven. 20 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-26 19:15:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1236 states and 1506 transitions. [2018-10-26 19:15:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1506 transitions. [2018-10-26 19:15:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 19:15:12,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 324 proven. 20 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-26 19:15:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1250 states and 1519 transitions. [2018-10-26 19:15:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1519 transitions. [2018-10-26 19:15:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-26 19:15:13,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-10-26 19:15:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1257 states and 1525 transitions. [2018-10-26 19:15:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1525 transitions. [2018-10-26 19:15:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-26 19:15:14,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-10-26 19:15:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1259 states and 1527 transitions. [2018-10-26 19:15:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1527 transitions. [2018-10-26 19:15:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-26 19:15:14,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-26 19:15:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1287 states and 1556 transitions. [2018-10-26 19:15:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1556 transitions. [2018-10-26 19:15:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-26 19:15:17,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-26 19:15:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1307 states and 1575 transitions. [2018-10-26 19:15:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1575 transitions. [2018-10-26 19:15:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 19:15:19,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 342 proven. 21 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-26 19:15:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1321 states and 1596 transitions. [2018-10-26 19:15:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1596 transitions. [2018-10-26 19:15:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 19:15:22,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 342 proven. 21 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-26 19:15:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1323 states and 1598 transitions. [2018-10-26 19:15:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1598 transitions. [2018-10-26 19:15:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-26 19:15:23,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 328 proven. 34 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-26 19:15:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1351 states and 1630 transitions. [2018-10-26 19:15:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1630 transitions. [2018-10-26 19:15:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 19:15:25,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 19:15:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1353 states and 1632 transitions. [2018-10-26 19:15:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1632 transitions. [2018-10-26 19:15:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-26 19:15:25,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-10-26 19:15:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1424 states and 1707 transitions. [2018-10-26 19:15:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1707 transitions. [2018-10-26 19:15:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-26 19:15:26,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:15:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1470 states and 1755 transitions. [2018-10-26 19:15:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1755 transitions. [2018-10-26 19:15:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-26 19:15:31,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:15:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1471 states and 1756 transitions. [2018-10-26 19:15:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1756 transitions. [2018-10-26 19:15:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-26 19:15:32,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:15:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1473 states and 1757 transitions. [2018-10-26 19:15:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1757 transitions. [2018-10-26 19:15:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-26 19:15:32,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 403 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:15:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1490 states and 1778 transitions. [2018-10-26 19:15:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1778 transitions. [2018-10-26 19:15:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-26 19:15:36,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 403 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:15:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1494 states and 1782 transitions. [2018-10-26 19:15:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1782 transitions. [2018-10-26 19:15:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-26 19:15:36,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 23 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:15:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1499 states and 1789 transitions. [2018-10-26 19:15:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1789 transitions. [2018-10-26 19:15:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-26 19:15:38,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 23 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:15:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1503 states and 1793 transitions. [2018-10-26 19:15:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1793 transitions. [2018-10-26 19:15:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-26 19:15:39,629 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 19:15:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:15:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1572 states and 1870 transitions. [2018-10-26 19:15:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1870 transitions. [2018-10-26 19:15:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-26 19:15:42,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:15:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:15:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:15:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:15:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:15:42,923 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 86 iterations. [2018-10-26 19:15:43,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 07:15:43 ImpRootNode [2018-10-26 19:15:43,197 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 19:15:43,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:15:43,197 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:15:43,197 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:15:43,198 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:14:05" (3/4) ... [2018-10-26 19:15:43,207 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 19:15:43,397 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f8ea1ed-0e01-4a39-899f-5cbcd618a95e/bin-2019/ukojak/witness.graphml [2018-10-26 19:15:43,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:15:43,398 INFO L168 Benchmark]: Toolchain (without parser) took 102313.71 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 958.0 MB in the beginning and 1.8 GB in the end (delta: -814.9 MB). Peak memory consumption was 820.9 MB. Max. memory is 11.5 GB. [2018-10-26 19:15:43,399 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-10-26 19:15:43,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.45 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 928.5 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 19:15:43,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.38 ms. Allocated memory is still 1.0 GB. Free memory was 928.5 MB in the beginning and 920.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:15:43,400 INFO L168 Benchmark]: Boogie Preprocessor took 171.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 920.4 MB in the beginning and 1.1 GB in the end (delta: -227.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:15:43,401 INFO L168 Benchmark]: RCFGBuilder took 3874.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.6 MB in the end (delta: 225.8 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:15:43,401 INFO L168 Benchmark]: CodeCheck took 97450.79 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 921.6 MB in the beginning and 1.8 GB in the end (delta: -885.5 MB). Peak memory consumption was 590.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:15:43,401 INFO L168 Benchmark]: Witness Printer took 200.48 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:15:43,403 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, 97.1s OverallTime, 86 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1181729732 SDtfs, 1650503750 SDslu, -721276376 SDs, 0 SdLazy, -38988394 SolverSat, 1622807728 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 353.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97514 GetRequests, 94181 SyntacticMatches, 2405 SemanticMatches, 928 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612959 ImplicationChecksByTransitivity, 80.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 14988 NumberOfCodeBlocks, 14988 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 14632 ConstructedInterpolants, 0 QuantifiedInterpolants, 14626710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 85 InterpolantComputations, 62 PerfectInterpolantSequences, 16873/17109 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: 401]: 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 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=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] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=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] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=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] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=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] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=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] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=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] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=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] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=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] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=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] [L377] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L378] a21 = 1 [L379] a16 = 6 [L380] a7 = 0 [L381] RET return -1; VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, 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 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=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, 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 FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] __VERIFIER_error() VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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 528.45 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 928.5 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.38 ms. Allocated memory is still 1.0 GB. Free memory was 928.5 MB in the beginning and 920.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 920.4 MB in the beginning and 1.1 GB in the end (delta: -227.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3874.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 921.6 MB in the end (delta: 225.8 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. * CodeCheck took 97450.79 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 921.6 MB in the beginning and 1.8 GB in the end (delta: -885.5 MB). Peak memory consumption was 590.3 MB. Max. memory is 11.5 GB. * Witness Printer took 200.48 ms. Allocated memory is still 2.7 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...