./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/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.24-678e011 [2019-11-19 23:44:17,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:44:17,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:44:17,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:44:17,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:44:17,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:44:17,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:44:17,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:44:17,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:44:17,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:44:17,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:44:17,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:44:17,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:44:17,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:44:17,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:44:17,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:44:17,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:44:17,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:44:17,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:44:17,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:44:17,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:44:17,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:44:17,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:44:17,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:44:17,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:44:17,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:44:17,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:44:17,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:44:17,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:44:17,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:44:17,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:44:17,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:44:17,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:44:17,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:44:17,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:44:17,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:44:17,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:44:17,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:44:17,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:44:17,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:44:17,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:44:17,688 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-19 23:44:17,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:44:17,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:44:17,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-19 23:44:17,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-19 23:44:17,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:44:17,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:44:17,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:44:17,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:44:17,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:44:17,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:44:17,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:44:17,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:44:17,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:44:17,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:44:17,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:44:17,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:44:17,715 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:44:17,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:44:17,715 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-19 23:44:17,716 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-19 23:44:17,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:44:17,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:44:17,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-19 23:44:17,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:44:17,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:44:17,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:44:17,717 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-19 23:44:17,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:44:17,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:44:17,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/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 [2019-11-19 23:44:17,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:44:17,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:44:17,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:44:17,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:44:17,872 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:44:17,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2019-11-19 23:44:17,923 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/data/7da6b51fe/9c67e3d1493e4038b1052f6d164d79dd/FLAG360fd0bbc [2019-11-19 23:44:18,464 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:44:18,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2019-11-19 23:44:18,475 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/data/7da6b51fe/9c67e3d1493e4038b1052f6d164d79dd/FLAG360fd0bbc [2019-11-19 23:44:18,942 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/data/7da6b51fe/9c67e3d1493e4038b1052f6d164d79dd [2019-11-19 23:44:18,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:44:18,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:44:18,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:44:18,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:44:18,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:44:18,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:44:18" (1/1) ... [2019-11-19 23:44:18,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b52e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:18, skipping insertion in model container [2019-11-19 23:44:18,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:44:18" (1/1) ... [2019-11-19 23:44:18,957 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:44:18,999 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:44:19,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:44:19,411 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:44:19,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:44:19,548 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:44:19,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19 WrapperNode [2019-11-19 23:44:19,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:44:19,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:44:19,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:44:19,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:44:19,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:44:19,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:44:19,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:44:19,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:44:19,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... [2019-11-19 23:44:19,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:44:19,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:44:19,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:44:19,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:44:19,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/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 [2019-11-19 23:44:19,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:44:19,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:44:21,798 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:44:21,799 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:44:21,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:44:21 BoogieIcfgContainer [2019-11-19 23:44:21,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:44:21,801 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-19 23:44:21,801 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-19 23:44:21,812 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-19 23:44:21,812 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:44:21" (1/1) ... [2019-11-19 23:44:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-11-19 23:44:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-11-19 23:44:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-19 23:44:21,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2019-11-19 23:44:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2019-11-19 23:44:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 23:44:22,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 23:44:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 146 states and 221 transitions. [2019-11-19 23:44:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-19 23:44:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 23:44:23,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 151 states and 230 transitions. [2019-11-19 23:44:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2019-11-19 23:44:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 23:44:23,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 221 states and 316 transitions. [2019-11-19 23:44:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 316 transitions. [2019-11-19 23:44:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 23:44:24,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 231 states and 333 transitions. [2019-11-19 23:44:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2019-11-19 23:44:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 23:44:25,265 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 242 states and 350 transitions. [2019-11-19 23:44:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 350 transitions. [2019-11-19 23:44:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 23:44:26,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 245 states and 353 transitions. [2019-11-19 23:44:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 353 transitions. [2019-11-19 23:44:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 23:44:26,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 247 states and 354 transitions. [2019-11-19 23:44:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2019-11-19 23:44:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-19 23:44:26,616 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 23:44:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 258 states and 368 transitions. [2019-11-19 23:44:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 368 transitions. [2019-11-19 23:44:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:44:27,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2019-11-19 23:44:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2019-11-19 23:44:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 23:44:27,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 23:44:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 272 states and 384 transitions. [2019-11-19 23:44:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 384 transitions. [2019-11-19 23:44:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 23:44:28,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 277 states and 391 transitions. [2019-11-19 23:44:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 391 transitions. [2019-11-19 23:44:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 23:44:28,714 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 23:44:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 288 states and 411 transitions. [2019-11-19 23:44:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 411 transitions. [2019-11-19 23:44:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 23:44:30,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 23:44:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 293 states and 418 transitions. [2019-11-19 23:44:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 418 transitions. [2019-11-19 23:44:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 23:44:30,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 312 states and 440 transitions. [2019-11-19 23:44:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 440 transitions. [2019-11-19 23:44:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 23:44:31,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 23:44:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 342 states and 478 transitions. [2019-11-19 23:44:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2019-11-19 23:44:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 23:44:33,777 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 23:44:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 346 states and 482 transitions. [2019-11-19 23:44:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 482 transitions. [2019-11-19 23:44:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-19 23:44:34,166 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 361 states and 499 transitions. [2019-11-19 23:44:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 499 transitions. [2019-11-19 23:44:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 23:44:34,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 379 states and 517 transitions. [2019-11-19 23:44:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 517 transitions. [2019-11-19 23:44:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-19 23:44:35,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 401 states and 545 transitions. [2019-11-19 23:44:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 545 transitions. [2019-11-19 23:44:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-19 23:44:37,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 406 states and 550 transitions. [2019-11-19 23:44:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 550 transitions. [2019-11-19 23:44:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 23:44:39,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 23:44:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 414 states and 562 transitions. [2019-11-19 23:44:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 562 transitions. [2019-11-19 23:44:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 23:44:40,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 23:44:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 415 states and 563 transitions. [2019-11-19 23:44:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 563 transitions. [2019-11-19 23:44:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-19 23:44:40,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 424 states and 581 transitions. [2019-11-19 23:44:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 581 transitions. [2019-11-19 23:44:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-19 23:44:42,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 426 states and 582 transitions. [2019-11-19 23:44:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 582 transitions. [2019-11-19 23:44:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-19 23:44:43,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 23:44:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 435 states and 591 transitions. [2019-11-19 23:44:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 591 transitions. [2019-11-19 23:44:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-19 23:44:43,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 451 states and 610 transitions. [2019-11-19 23:44:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 610 transitions. [2019-11-19 23:44:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-19 23:44:44,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 23:44:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 453 states and 612 transitions. [2019-11-19 23:44:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 612 transitions. [2019-11-19 23:44:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-19 23:44:44,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 490 states and 656 transitions. [2019-11-19 23:44:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 656 transitions. [2019-11-19 23:44:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-19 23:44:47,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 499 states and 666 transitions. [2019-11-19 23:44:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 666 transitions. [2019-11-19 23:44:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-19 23:44:49,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 527 states and 702 transitions. [2019-11-19 23:44:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 702 transitions. [2019-11-19 23:44:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-19 23:44:52,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 89 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 532 states and 708 transitions. [2019-11-19 23:44:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 708 transitions. [2019-11-19 23:44:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-19 23:44:52,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 573 states and 752 transitions. [2019-11-19 23:44:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 752 transitions. [2019-11-19 23:44:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-19 23:44:53,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 598 states and 782 transitions. [2019-11-19 23:44:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 782 transitions. [2019-11-19 23:44:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-19 23:44:54,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 23:44:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 605 states and 791 transitions. [2019-11-19 23:44:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 791 transitions. [2019-11-19 23:44:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-19 23:44:55,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:44:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 625 states and 814 transitions. [2019-11-19 23:44:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 814 transitions. [2019-11-19 23:44:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-19 23:44:57,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 23:44:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 641 states and 830 transitions. [2019-11-19 23:44:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 830 transitions. [2019-11-19 23:44:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-19 23:44:58,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 23:44:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 644 states and 833 transitions. [2019-11-19 23:44:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 833 transitions. [2019-11-19 23:44:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-19 23:44:58,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:44:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:44:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 656 states and 846 transitions. [2019-11-19 23:44:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 846 transitions. [2019-11-19 23:44:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-19 23:44:58,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:44:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 721 states and 913 transitions. [2019-11-19 23:45:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 913 transitions. [2019-11-19 23:45:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-19 23:45:02,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 778 states and 975 transitions. [2019-11-19 23:45:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 975 transitions. [2019-11-19 23:45:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 23:45:07,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 23:45:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 782 states and 979 transitions. [2019-11-19 23:45:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 979 transitions. [2019-11-19 23:45:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 23:45:08,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 851 states and 1060 transitions. [2019-11-19 23:45:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1060 transitions. [2019-11-19 23:45:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 23:45:12,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 855 states and 1063 transitions. [2019-11-19 23:45:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1063 transitions. [2019-11-19 23:45:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 23:45:13,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 23:45:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 873 states and 1081 transitions. [2019-11-19 23:45:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1081 transitions. [2019-11-19 23:45:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-19 23:45:13,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-19 23:45:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 877 states and 1084 transitions. [2019-11-19 23:45:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1084 transitions. [2019-11-19 23:45:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-19 23:45:14,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 23:45:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 879 states and 1086 transitions. [2019-11-19 23:45:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1086 transitions. [2019-11-19 23:45:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-19 23:45:14,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 880 states and 1088 transitions. [2019-11-19 23:45:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1088 transitions. [2019-11-19 23:45:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-19 23:45:14,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 23:45:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 890 states and 1101 transitions. [2019-11-19 23:45:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1101 transitions. [2019-11-19 23:45:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-19 23:45:16,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 961 states and 1172 transitions. [2019-11-19 23:45:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1172 transitions. [2019-11-19 23:45:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-19 23:45:18,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 23:45:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 991 states and 1210 transitions. [2019-11-19 23:45:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1210 transitions. [2019-11-19 23:45:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-19 23:45:22,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 23:45:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 995 states and 1215 transitions. [2019-11-19 23:45:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1215 transitions. [2019-11-19 23:45:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-19 23:45:23,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:45:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 997 states and 1217 transitions. [2019-11-19 23:45:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1217 transitions. [2019-11-19 23:45:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-19 23:45:23,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 23:45:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1012 states and 1238 transitions. [2019-11-19 23:45:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1238 transitions. [2019-11-19 23:45:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-19 23:45:25,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 23:45:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1017 states and 1244 transitions. [2019-11-19 23:45:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1244 transitions. [2019-11-19 23:45:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-19 23:45:26,824 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-19 23:45:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1020 states and 1248 transitions. [2019-11-19 23:45:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1248 transitions. [2019-11-19 23:45:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-19 23:45:27,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1068 states and 1309 transitions. [2019-11-19 23:45:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1309 transitions. [2019-11-19 23:45:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-19 23:45:33,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1072 states and 1312 transitions. [2019-11-19 23:45:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1312 transitions. [2019-11-19 23:45:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-19 23:45:34,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 23:45:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1076 states and 1318 transitions. [2019-11-19 23:45:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1318 transitions. [2019-11-19 23:45:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-19 23:45:35,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 175 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 23:45:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1079 states and 1321 transitions. [2019-11-19 23:45:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1321 transitions. [2019-11-19 23:45:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-19 23:45:36,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1106 states and 1357 transitions. [2019-11-19 23:45:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1357 transitions. [2019-11-19 23:45:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-19 23:45:40,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1112 states and 1361 transitions. [2019-11-19 23:45:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1361 transitions. [2019-11-19 23:45:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-19 23:45:41,096 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-19 23:45:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1120 states and 1368 transitions. [2019-11-19 23:45:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1368 transitions. [2019-11-19 23:45:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-19 23:45:41,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 23:45:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1156 states and 1407 transitions. [2019-11-19 23:45:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1407 transitions. [2019-11-19 23:45:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-19 23:45:43,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:45:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1158 states and 1409 transitions. [2019-11-19 23:45:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1409 transitions. [2019-11-19 23:45:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-19 23:45:44,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:45:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1216 states and 1473 transitions. [2019-11-19 23:45:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1473 transitions. [2019-11-19 23:45:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-19 23:45:52,172 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:45:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1269 states and 1531 transitions. [2019-11-19 23:45:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1531 transitions. [2019-11-19 23:45:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-19 23:45:55,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 23:45:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:45:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1296 states and 1564 transitions. [2019-11-19 23:45:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1564 transitions. [2019-11-19 23:45:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-19 23:45:57,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:45:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:46:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1350 states and 1633 transitions. [2019-11-19 23:46:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1633 transitions. [2019-11-19 23:46:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-19 23:46:02,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:46:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1360 states and 1645 transitions. [2019-11-19 23:46:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1645 transitions. [2019-11-19 23:46:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-19 23:46:04,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 23:46:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1408 states and 1693 transitions. [2019-11-19 23:46:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1693 transitions. [2019-11-19 23:46:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-19 23:46:11,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-19 23:46:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1413 states and 1702 transitions. [2019-11-19 23:46:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1702 transitions. [2019-11-19 23:46:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-19 23:46:12,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:46:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1429 states and 1721 transitions. [2019-11-19 23:46:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1721 transitions. [2019-11-19 23:46:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-19 23:46:17,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:46:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1432 states and 1724 transitions. [2019-11-19 23:46:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1724 transitions. [2019-11-19 23:46:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-19 23:46:18,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-19 23:46:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1467 states and 1764 transitions. [2019-11-19 23:46:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1764 transitions. [2019-11-19 23:46:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-19 23:46:21,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:46:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1489 states and 1791 transitions. [2019-11-19 23:46:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1791 transitions. [2019-11-19 23:46:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-19 23:46:25,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:46:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1509 states and 1812 transitions. [2019-11-19 23:46:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1812 transitions. [2019-11-19 23:46:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-19 23:46:28,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-19 23:46:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1513 states and 1822 transitions. [2019-11-19 23:46:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1822 transitions. [2019-11-19 23:46:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-19 23:46:29,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-19 23:46:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1583 states and 1900 transitions. [2019-11-19 23:46:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1900 transitions. [2019-11-19 23:46:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-19 23:46:30,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-19 23:46:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1586 states and 1904 transitions. [2019-11-19 23:46:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1904 transitions. [2019-11-19 23:46:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-19 23:46:31,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 23:46:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1613 states and 1934 transitions. [2019-11-19 23:46:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1934 transitions. [2019-11-19 23:46:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-19 23:46:35,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 23:46:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1614 states and 1934 transitions. [2019-11-19 23:46:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1934 transitions. [2019-11-19 23:46:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-19 23:46:37,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 269 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-19 23:46:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1671 states and 1997 transitions. [2019-11-19 23:46:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1997 transitions. [2019-11-19 23:46:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-19 23:46:39,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 269 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-19 23:46:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 1674 states and 2000 transitions. [2019-11-19 23:46:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2000 transitions. [2019-11-19 23:46:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-19 23:46:40,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 206 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-19 23:46:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1710 states and 2037 transitions. [2019-11-19 23:46:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2037 transitions. [2019-11-19 23:46:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-19 23:46:42,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 206 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-19 23:46:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-19 23:46:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 1711 states and 2038 transitions. [2019-11-19 23:46:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2038 transitions. [2019-11-19 23:46:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-19 23:46:43,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-19 23:46:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:46:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:46:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:46:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:46:43,551 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 87 iterations. [2019-11-19 23:46:43,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 19.11 11:46:43 ImpRootNode [2019-11-19 23:46:43,798 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-19 23:46:43,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:46:43,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:46:43,799 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:46:43,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:44:21" (3/4) ... [2019-11-19 23:46:43,802 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 23:46:44,039 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_84e6ab57-788d-41d0-b03e-5b94f97d4ece/bin/ukojak/witness.graphml [2019-11-19 23:46:44,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:46:44,041 INFO L168 Benchmark]: Toolchain (without parser) took 145095.30 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 943.4 MB in the beginning and 1.3 GB in the end (delta: -352.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-19 23:46:44,041 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:46:44,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:46:44,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.74 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:46:44,042 INFO L168 Benchmark]: Boogie Preprocessor took 80.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:46:44,043 INFO L168 Benchmark]: RCFGBuilder took 2071.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 217.6 MB). Peak memory consumption was 217.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:46:44,043 INFO L168 Benchmark]: CodeCheck took 141997.93 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 892.4 MB in the beginning and 1.3 GB in the end (delta: -417.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-19 23:46:44,044 INFO L168 Benchmark]: Witness Printer took 240.31 ms. Allocated memory is still 3.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:46:44,046 INFO L335 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, 76 locations, 1 error locations. Result: UNSAFE, OverallTime: 141.7s, OverallIterations: 87, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -1139704320 SDtfs, 132734902 SDslu, 2020178944 SDs, 0 SdLazy, 909799778 SolverSat, -1334668432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 339.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87363 GetRequests, 83766 SyntacticMatches, 2547 SemanticMatches, 1050 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775890 ImplicationChecksByTransitivity, 122.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 13075 NumberOfCodeBlocks, 13075 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 12724 ConstructedInterpolants, 0 QuantifiedInterpolants, 10945244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 86 InterpolantComputations, 60 PerfectInterpolantSequences, 10079/10409 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 603.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.74 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2071.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 217.6 MB). Peak memory consumption was 217.6 MB. Max. memory is 11.5 GB. * CodeCheck took 141997.93 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 892.4 MB in the beginning and 1.3 GB in the end (delta: -417.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 240.31 ms. Allocated memory is still 3.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...