./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/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_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/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-635dfa2 [2018-12-09 15:06:45,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:06:45,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:06:45,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:06:45,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:06:45,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:06:45,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:06:45,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:06:45,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:06:45,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:06:45,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:06:45,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:06:45,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:06:45,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:06:45,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:06:45,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:06:45,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:06:45,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:06:45,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:06:45,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:06:45,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:06:45,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:06:45,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:06:45,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:06:45,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:06:45,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:06:45,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:06:45,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:06:45,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:06:45,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:06:45,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:06:45,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:06:45,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:06:45,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:06:45,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:06:45,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:06:45,482 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 15:06:45,489 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:06:45,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:06:45,490 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:06:45,490 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 15:06:45,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:06:45,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:06:45,490 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:06:45,490 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:06:45,491 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:06:45,491 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 15:06:45,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 15:06:45,492 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:06:45,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:06:45,492 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_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/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-12-09 15:06:45,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:06:45,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:06:45,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:06:45,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:06:45,519 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:06:45,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-12-09 15:06:45,553 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/data/9a117ba02/d19a58bc42174a2ab34b6d04275466e1/FLAGc09bc91b9 [2018-12-09 15:06:46,006 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:06:46,006 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/sv-benchmarks/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-12-09 15:06:46,013 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/data/9a117ba02/d19a58bc42174a2ab34b6d04275466e1/FLAGc09bc91b9 [2018-12-09 15:06:46,022 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/data/9a117ba02/d19a58bc42174a2ab34b6d04275466e1 [2018-12-09 15:06:46,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:06:46,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:06:46,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:06:46,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:06:46,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:06:46,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46, skipping insertion in model container [2018-12-09 15:06:46,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:06:46,063 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:06:46,255 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:06:46,259 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:06:46,365 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:06:46,378 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:06:46,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46 WrapperNode [2018-12-09 15:06:46,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:06:46,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:06:46,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:06:46,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:06:46,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:06:46,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:06:46,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:06:46,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:06:46,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... [2018-12-09 15:06:46,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:06:46,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:06:46,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:06:46,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:06:46,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 15:06:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:06:46,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:06:47,474 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:06:47,474 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 15:06:47,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:47 BoogieIcfgContainer [2018-12-09 15:06:47,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:06:47,475 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 15:06:47,475 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 15:06:47,483 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 15:06:47,483 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:47" (1/1) ... [2018-12-09 15:06:47,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-09 15:06:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-09 15:06:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 15:06:47,522 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2018-12-09 15:06:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2018-12-09 15:06:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 15:06:48,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 15:06:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 146 states and 221 transitions. [2018-12-09 15:06:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2018-12-09 15:06:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 15:06:48,200 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 151 states and 230 transitions. [2018-12-09 15:06:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2018-12-09 15:06:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 15:06:48,322 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 221 states and 316 transitions. [2018-12-09 15:06:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 316 transitions. [2018-12-09 15:06:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 15:06:48,742 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 231 states and 333 transitions. [2018-12-09 15:06:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2018-12-09 15:06:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 15:06:49,109 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 242 states and 350 transitions. [2018-12-09 15:06:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 350 transitions. [2018-12-09 15:06:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 15:06:49,598 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 245 states and 353 transitions. [2018-12-09 15:06:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 353 transitions. [2018-12-09 15:06:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 15:06:49,725 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 247 states and 354 transitions. [2018-12-09 15:06:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2018-12-09 15:06:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 15:06:49,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 15:06:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 258 states and 368 transitions. [2018-12-09 15:06:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 368 transitions. [2018-12-09 15:06:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 15:06:50,073 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:06:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2018-12-09 15:06:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2018-12-09 15:06:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:06:50,337 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 15:06:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 272 states and 384 transitions. [2018-12-09 15:06:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 384 transitions. [2018-12-09 15:06:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:06:50,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:06:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 277 states and 391 transitions. [2018-12-09 15:06:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 391 transitions. [2018-12-09 15:06:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:06:50,842 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 15:06:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 288 states and 411 transitions. [2018-12-09 15:06:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 411 transitions. [2018-12-09 15:06:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:06:51,451 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 15:06:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 293 states and 418 transitions. [2018-12-09 15:06:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 418 transitions. [2018-12-09 15:06:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:06:51,715 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 312 states and 440 transitions. [2018-12-09 15:06:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 440 transitions. [2018-12-09 15:06:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 15:06:52,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 15:06:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 342 states and 478 transitions. [2018-12-09 15:06:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2018-12-09 15:06:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 15:06:53,178 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 15:06:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 346 states and 482 transitions. [2018-12-09 15:06:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 482 transitions. [2018-12-09 15:06:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 15:06:53,391 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 361 states and 499 transitions. [2018-12-09 15:06:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 499 transitions. [2018-12-09 15:06:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 15:06:53,774 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:06:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 379 states and 517 transitions. [2018-12-09 15:06:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 517 transitions. [2018-12-09 15:06:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 15:06:54,174 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:06:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 401 states and 546 transitions. [2018-12-09 15:06:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 546 transitions. [2018-12-09 15:06:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 15:06:55,544 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:06:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 406 states and 551 transitions. [2018-12-09 15:06:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 551 transitions. [2018-12-09 15:06:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 15:06:56,106 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 15:06:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 414 states and 563 transitions. [2018-12-09 15:06:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 563 transitions. [2018-12-09 15:06:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 15:06:56,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 15:06:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 415 states and 564 transitions. [2018-12-09 15:06:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 564 transitions. [2018-12-09 15:06:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 15:06:56,926 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:06:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 424 states and 578 transitions. [2018-12-09 15:06:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 578 transitions. [2018-12-09 15:06:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 15:06:58,208 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 15:06:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 433 states and 587 transitions. [2018-12-09 15:06:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 587 transitions. [2018-12-09 15:06:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 15:06:58,259 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:06:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 449 states and 606 transitions. [2018-12-09 15:06:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 606 transitions. [2018-12-09 15:06:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 15:06:58,605 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 15:06:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:06:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 451 states and 608 transitions. [2018-12-09 15:06:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 608 transitions. [2018-12-09 15:06:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 15:06:58,645 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:06:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 493 states and 658 transitions. [2018-12-09 15:07:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 658 transitions. [2018-12-09 15:07:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 15:07:01,021 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 521 states and 694 transitions. [2018-12-09 15:07:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 694 transitions. [2018-12-09 15:07:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 15:07:03,108 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 526 states and 700 transitions. [2018-12-09 15:07:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 700 transitions. [2018-12-09 15:07:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 15:07:03,385 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:07:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 567 states and 744 transitions. [2018-12-09 15:07:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 744 transitions. [2018-12-09 15:07:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 15:07:03,866 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:07:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 592 states and 774 transitions. [2018-12-09 15:07:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 774 transitions. [2018-12-09 15:07:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-09 15:07:04,275 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 15:07:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 599 states and 783 transitions. [2018-12-09 15:07:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 783 transitions. [2018-12-09 15:07:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-09 15:07:04,499 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 619 states and 806 transitions. [2018-12-09 15:07:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 806 transitions. [2018-12-09 15:07:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 15:07:05,879 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 15:07:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 635 states and 822 transitions. [2018-12-09 15:07:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 822 transitions. [2018-12-09 15:07:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 15:07:06,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 15:07:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 638 states and 825 transitions. [2018-12-09 15:07:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 825 transitions. [2018-12-09 15:07:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 15:07:06,254 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 15:07:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 654 states and 841 transitions. [2018-12-09 15:07:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 841 transitions. [2018-12-09 15:07:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 15:07:06,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 15:07:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 658 states and 845 transitions. [2018-12-09 15:07:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 845 transitions. [2018-12-09 15:07:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 15:07:06,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:07:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 670 states and 858 transitions. [2018-12-09 15:07:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 858 transitions. [2018-12-09 15:07:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 15:07:06,910 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 735 states and 925 transitions. [2018-12-09 15:07:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 925 transitions. [2018-12-09 15:07:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 15:07:09,610 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 792 states and 987 transitions. [2018-12-09 15:07:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 987 transitions. [2018-12-09 15:07:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 15:07:14,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 15:07:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 796 states and 991 transitions. [2018-12-09 15:07:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 991 transitions. [2018-12-09 15:07:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 15:07:14,649 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 865 states and 1072 transitions. [2018-12-09 15:07:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1072 transitions. [2018-12-09 15:07:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 15:07:18,647 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 869 states and 1075 transitions. [2018-12-09 15:07:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1075 transitions. [2018-12-09 15:07:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 15:07:19,037 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 15:07:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 887 states and 1093 transitions. [2018-12-09 15:07:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1093 transitions. [2018-12-09 15:07:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 15:07:19,114 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-09 15:07:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 891 states and 1096 transitions. [2018-12-09 15:07:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1096 transitions. [2018-12-09 15:07:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 15:07:19,497 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 15:07:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 893 states and 1098 transitions. [2018-12-09 15:07:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1098 transitions. [2018-12-09 15:07:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 15:07:19,535 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 894 states and 1100 transitions. [2018-12-09 15:07:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1100 transitions. [2018-12-09 15:07:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 15:07:19,624 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 15:07:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 902 states and 1111 transitions. [2018-12-09 15:07:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1111 transitions. [2018-12-09 15:07:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 15:07:20,624 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 15:07:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 904 states and 1113 transitions. [2018-12-09 15:07:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1113 transitions. [2018-12-09 15:07:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 15:07:20,860 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 975 states and 1184 transitions. [2018-12-09 15:07:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1184 transitions. [2018-12-09 15:07:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 15:07:22,073 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 15:07:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1005 states and 1222 transitions. [2018-12-09 15:07:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1222 transitions. [2018-12-09 15:07:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 15:07:24,397 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 15:07:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1009 states and 1227 transitions. [2018-12-09 15:07:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1227 transitions. [2018-12-09 15:07:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 15:07:24,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:07:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1011 states and 1229 transitions. [2018-12-09 15:07:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1229 transitions. [2018-12-09 15:07:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 15:07:25,200 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 15:07:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1026 states and 1250 transitions. [2018-12-09 15:07:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1250 transitions. [2018-12-09 15:07:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 15:07:27,228 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 15:07:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1031 states and 1256 transitions. [2018-12-09 15:07:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1256 transitions. [2018-12-09 15:07:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-09 15:07:28,160 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 15:07:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1034 states and 1260 transitions. [2018-12-09 15:07:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1260 transitions. [2018-12-09 15:07:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 15:07:28,367 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1082 states and 1321 transitions. [2018-12-09 15:07:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1321 transitions. [2018-12-09 15:07:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 15:07:32,246 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1086 states and 1324 transitions. [2018-12-09 15:07:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1324 transitions. [2018-12-09 15:07:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 15:07:32,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 15:07:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1090 states and 1330 transitions. [2018-12-09 15:07:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1330 transitions. [2018-12-09 15:07:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 15:07:33,732 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 15:07:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1093 states and 1333 transitions. [2018-12-09 15:07:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1333 transitions. [2018-12-09 15:07:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 15:07:34,085 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1120 states and 1369 transitions. [2018-12-09 15:07:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1369 transitions. [2018-12-09 15:07:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 15:07:38,542 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1126 states and 1373 transitions. [2018-12-09 15:07:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1373 transitions. [2018-12-09 15:07:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 15:07:39,167 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 15:07:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1134 states and 1380 transitions. [2018-12-09 15:07:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1380 transitions. [2018-12-09 15:07:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 15:07:39,233 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 15:07:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1170 states and 1419 transitions. [2018-12-09 15:07:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1419 transitions. [2018-12-09 15:07:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-09 15:07:41,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 15:07:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1172 states and 1421 transitions. [2018-12-09 15:07:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1421 transitions. [2018-12-09 15:07:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 15:07:41,287 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:07:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1230 states and 1485 transitions. [2018-12-09 15:07:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1485 transitions. [2018-12-09 15:07:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 15:07:50,383 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 15:07:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1283 states and 1543 transitions. [2018-12-09 15:07:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1543 transitions. [2018-12-09 15:07:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 15:07:52,540 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 15:07:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:07:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1294 states and 1560 transitions. [2018-12-09 15:07:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1560 transitions. [2018-12-09 15:07:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 15:07:53,871 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:07:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:07:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:08:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1348 states and 1630 transitions. [2018-12-09 15:08:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1630 transitions. [2018-12-09 15:08:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 15:08:01,562 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:08:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1358 states and 1641 transitions. [2018-12-09 15:08:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1641 transitions. [2018-12-09 15:08:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 15:08:02,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 15:08:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1406 states and 1689 transitions. [2018-12-09 15:08:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1689 transitions. [2018-12-09 15:08:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 15:08:07,184 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 15:08:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1411 states and 1698 transitions. [2018-12-09 15:08:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1698 transitions. [2018-12-09 15:08:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 15:08:07,695 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:08:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1427 states and 1717 transitions. [2018-12-09 15:08:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1717 transitions. [2018-12-09 15:08:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 15:08:11,424 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:08:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1430 states and 1720 transitions. [2018-12-09 15:08:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1720 transitions. [2018-12-09 15:08:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-09 15:08:11,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 15:08:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1465 states and 1759 transitions. [2018-12-09 15:08:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1759 transitions. [2018-12-09 15:08:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 15:08:13,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:08:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1503 states and 1804 transitions. [2018-12-09 15:08:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1804 transitions. [2018-12-09 15:08:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 15:08:20,524 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:08:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1507 states and 1809 transitions. [2018-12-09 15:08:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1809 transitions. [2018-12-09 15:08:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-09 15:08:21,633 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 15:08:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1511 states and 1819 transitions. [2018-12-09 15:08:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1819 transitions. [2018-12-09 15:08:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-09 15:08:21,906 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-09 15:08:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1581 states and 1897 transitions. [2018-12-09 15:08:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1897 transitions. [2018-12-09 15:08:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-09 15:08:23,769 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-09 15:08:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1584 states and 1901 transitions. [2018-12-09 15:08:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1901 transitions. [2018-12-09 15:08:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 15:08:24,668 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 15:08:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1595 states and 1915 transitions. [2018-12-09 15:08:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1915 transitions. [2018-12-09 15:08:26,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 15:08:26,710 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 15:08:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1612 states and 1931 transitions. [2018-12-09 15:08:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1931 transitions. [2018-12-09 15:08:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 15:08:27,848 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 269 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 15:08:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1669 states and 1994 transitions. [2018-12-09 15:08:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 1994 transitions. [2018-12-09 15:08:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 15:08:28,937 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 269 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 15:08:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1672 states and 1997 transitions. [2018-12-09 15:08:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1997 transitions. [2018-12-09 15:08:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-09 15:08:29,313 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 206 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-09 15:08:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 1708 states and 2034 transitions. [2018-12-09 15:08:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2034 transitions. [2018-12-09 15:08:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-09 15:08:31,772 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:08:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 206 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-09 15:08:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:08:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1709 states and 2035 transitions. [2018-12-09 15:08:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2035 transitions. [2018-12-09 15:08:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-09 15:08:32,143 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:08:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:08:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:08:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:08:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:08:32,334 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 88 iterations. [2018-12-09 15:08:32,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 03:08:32 ImpRootNode [2018-12-09 15:08:32,440 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 15:08:32,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:08:32,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:08:32,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:08:32,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:47" (3/4) ... [2018-12-09 15:08:32,443 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 15:08:32,532 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_06ef145a-6c35-4b3c-b1db-d9949f6cb78f/bin-2019/ukojak/witness.graphml [2018-12-09 15:08:32,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:08:32,533 INFO L168 Benchmark]: Toolchain (without parser) took 106509.22 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 944.2 MB in the beginning and 1.2 GB in the end (delta: -263.6 MB). Peak memory consumption was 752.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:08:32,534 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:08:32,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:08:32,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:08:32,534 INFO L168 Benchmark]: Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:08:32,535 INFO L168 Benchmark]: RCFGBuilder took 1027.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.6 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:08:32,535 INFO L168 Benchmark]: CodeCheck took 104965.14 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 914.6 MB in the beginning and 1.3 GB in the end (delta: -336.4 MB). Peak memory consumption was 518.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:08:32,535 INFO L168 Benchmark]: Witness Printer took 91.70 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:08:32,536 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 104.8s OverallTime, 88 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1139704320 SDtfs, 1221190422 SDslu, 2020178944 SDs, 0 SdLazy, 1978772514 SolverSat, -1337667888 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 207.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88360 GetRequests, 84919 SyntacticMatches, 2399 SemanticMatches, 1042 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758679 ImplicationChecksByTransitivity, 92.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 13245 NumberOfCodeBlocks, 13245 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 12893 ConstructedInterpolants, 0 QuantifiedInterpolants, 10996092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 62 PerfectInterpolantSequences, 10236/10565 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)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND 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] 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] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=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] 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] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1027.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.6 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. * CodeCheck took 104965.14 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 914.6 MB in the beginning and 1.3 GB in the end (delta: -336.4 MB). Peak memory consumption was 518.7 MB. Max. memory is 11.5 GB. * Witness Printer took 91.70 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...