./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57e353c10138ec2622717fe5a2a63bf5f83b2f5b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-69874e2 [2020-12-01 16:45:51,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 16:45:51,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 16:45:51,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 16:45:51,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 16:45:51,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 16:45:51,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 16:45:51,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 16:45:51,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 16:45:51,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 16:45:51,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 16:45:51,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 16:45:51,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 16:45:51,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 16:45:51,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 16:45:51,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 16:45:51,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 16:45:51,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 16:45:51,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 16:45:51,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 16:45:51,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 16:45:52,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 16:45:52,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 16:45:52,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 16:45:52,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 16:45:52,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 16:45:52,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 16:45:52,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 16:45:52,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 16:45:52,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 16:45:52,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 16:45:52,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 16:45:52,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 16:45:52,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 16:45:52,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 16:45:52,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 16:45:52,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 16:45:52,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 16:45:52,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 16:45:52,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 16:45:52,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 16:45:52,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 16:45:52,066 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 16:45:52,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 16:45:52,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 16:45:52,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 16:45:52,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 16:45:52,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 16:45:52,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 16:45:52,077 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 16:45:52,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 16:45:52,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 16:45:52,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 16:45:52,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 16:45:52,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 16:45:52,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 16:45:52,080 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 16:45:52,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 16:45:52,080 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 16:45:52,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 16:45:52,081 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 16:45:52,081 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 16:45:52,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 16:45:52,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 16:45:52,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 16:45:52,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 16:45:52,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 16:45:52,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 16:45:52,083 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 16:45:52,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 16:45:52,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 16:45:52,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/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(reach_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 -> 57e353c10138ec2622717fe5a2a63bf5f83b2f5b [2020-12-01 16:45:52,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 16:45:52,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 16:45:52,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 16:45:52,468 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 16:45:52,470 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 16:45:52,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2020-12-01 16:45:52,564 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/data/ffdbecc95/7db8f70cfa554dc4986182f01c0753a3/FLAG30caa3eee [2020-12-01 16:45:53,312 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 16:45:53,313 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2020-12-01 16:45:53,332 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/data/ffdbecc95/7db8f70cfa554dc4986182f01c0753a3/FLAG30caa3eee [2020-12-01 16:45:53,552 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/data/ffdbecc95/7db8f70cfa554dc4986182f01c0753a3 [2020-12-01 16:45:53,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 16:45:53,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 16:45:53,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 16:45:53,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 16:45:53,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 16:45:53,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:45:53" (1/1) ... [2020-12-01 16:45:53,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e6b751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:53, skipping insertion in model container [2020-12-01 16:45:53,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:45:53" (1/1) ... [2020-12-01 16:45:53,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 16:45:53,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 16:45:54,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:45:54,057 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 16:45:54,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:45:54,240 INFO L208 MainTranslator]: Completed translation [2020-12-01 16:45:54,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54 WrapperNode [2020-12-01 16:45:54,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 16:45:54,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 16:45:54,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 16:45:54,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 16:45:54,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 16:45:54,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 16:45:54,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 16:45:54,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 16:45:54,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... [2020-12-01 16:45:54,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 16:45:54,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 16:45:54,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 16:45:54,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 16:45:54,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:45:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/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 [2020-12-01 16:45:54,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 16:45:54,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 16:45:54,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 16:45:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 16:45:56,557 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 16:45:56,558 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-01 16:45:56,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:45:56 BoogieIcfgContainer [2020-12-01 16:45:56,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 16:45:56,561 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 16:45:56,561 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 16:45:56,573 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 16:45:56,573 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:45:56" (1/1) ... [2020-12-01 16:45:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:45:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:45:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-12-01 16:45:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-12-01 16:45:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 16:45:56,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:45:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:45:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:45:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:45:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2020-12-01 16:45:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2020-12-01 16:45:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 16:45:57,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:45:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:45:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:45:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:45:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2020-12-01 16:45:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2020-12-01 16:45:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 16:45:58,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:45:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:45:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:45:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:45:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 220 states and 347 transitions. [2020-12-01 16:45:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 347 transitions. [2020-12-01 16:45:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 16:45:58,844 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:45:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:45:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:45:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:45:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 296 states and 434 transitions. [2020-12-01 16:45:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 434 transitions. [2020-12-01 16:45:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-01 16:45:59,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:45:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:45:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 312 states and 453 transitions. [2020-12-01 16:46:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 453 transitions. [2020-12-01 16:46:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-01 16:46:00,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 322 states and 466 transitions. [2020-12-01 16:46:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 466 transitions. [2020-12-01 16:46:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-01 16:46:00,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 349 states and 498 transitions. [2020-12-01 16:46:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 498 transitions. [2020-12-01 16:46:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 16:46:01,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 360 states and 514 transitions. [2020-12-01 16:46:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 514 transitions. [2020-12-01 16:46:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 16:46:02,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 370 states and 528 transitions. [2020-12-01 16:46:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 528 transitions. [2020-12-01 16:46:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 16:46:02,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 375 states and 533 transitions. [2020-12-01 16:46:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 533 transitions. [2020-12-01 16:46:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 16:46:02,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 381 states and 539 transitions. [2020-12-01 16:46:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 539 transitions. [2020-12-01 16:46:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 16:46:03,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 392 states and 552 transitions. [2020-12-01 16:46:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 552 transitions. [2020-12-01 16:46:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 16:46:03,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 398 states and 560 transitions. [2020-12-01 16:46:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 560 transitions. [2020-12-01 16:46:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 16:46:04,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 407 states and 573 transitions. [2020-12-01 16:46:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 573 transitions. [2020-12-01 16:46:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 16:46:04,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 410 states and 577 transitions. [2020-12-01 16:46:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 577 transitions. [2020-12-01 16:46:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 16:46:04,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 411 states and 577 transitions. [2020-12-01 16:46:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 577 transitions. [2020-12-01 16:46:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 16:46:05,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 413 states and 579 transitions. [2020-12-01 16:46:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 579 transitions. [2020-12-01 16:46:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 16:46:05,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 421 states and 588 transitions. [2020-12-01 16:46:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 588 transitions. [2020-12-01 16:46:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 16:46:05,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 16:46:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 434 states and 605 transitions. [2020-12-01 16:46:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 605 transitions. [2020-12-01 16:46:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 16:46:06,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-12-01 16:46:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 446 states and 619 transitions. [2020-12-01 16:46:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 619 transitions. [2020-12-01 16:46:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 16:46:07,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 451 states and 626 transitions. [2020-12-01 16:46:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 626 transitions. [2020-12-01 16:46:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 16:46:07,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 456 states and 631 transitions. [2020-12-01 16:46:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 631 transitions. [2020-12-01 16:46:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 16:46:08,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 466 states and 642 transitions. [2020-12-01 16:46:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 642 transitions. [2020-12-01 16:46:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 16:46:08,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 483 states and 661 transitions. [2020-12-01 16:46:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 661 transitions. [2020-12-01 16:46:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-01 16:46:08,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:46:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 503 states and 683 transitions. [2020-12-01 16:46:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 683 transitions. [2020-12-01 16:46:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-01 16:46:09,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 16:46:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 520 states and 702 transitions. [2020-12-01 16:46:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 702 transitions. [2020-12-01 16:46:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-01 16:46:09,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 16:46:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 522 states and 704 transitions. [2020-12-01 16:46:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 704 transitions. [2020-12-01 16:46:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-01 16:46:09,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 540 states and 723 transitions. [2020-12-01 16:46:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 723 transitions. [2020-12-01 16:46:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-01 16:46:10,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 16:46:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 559 states and 743 transitions. [2020-12-01 16:46:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 743 transitions. [2020-12-01 16:46:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-01 16:46:10,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:46:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 577 states and 763 transitions. [2020-12-01 16:46:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 763 transitions. [2020-12-01 16:46:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-01 16:46:11,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 591 states and 777 transitions. [2020-12-01 16:46:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 777 transitions. [2020-12-01 16:46:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-01 16:46:11,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 620 states and 810 transitions. [2020-12-01 16:46:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 810 transitions. [2020-12-01 16:46:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-01 16:46:12,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 16:46:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 648 states and 839 transitions. [2020-12-01 16:46:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 839 transitions. [2020-12-01 16:46:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 16:46:13,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 688 states and 884 transitions. [2020-12-01 16:46:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 884 transitions. [2020-12-01 16:46:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 16:46:13,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 758 states and 963 transitions. [2020-12-01 16:46:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 963 transitions. [2020-12-01 16:46:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 16:46:14,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 797 states and 1003 transitions. [2020-12-01 16:46:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1003 transitions. [2020-12-01 16:46:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 16:46:15,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 836 states and 1047 transitions. [2020-12-01 16:46:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1047 transitions. [2020-12-01 16:46:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 16:46:15,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 16:46:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 837 states and 1047 transitions. [2020-12-01 16:46:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1047 transitions. [2020-12-01 16:46:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-01 16:46:16,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:46:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 858 states and 1068 transitions. [2020-12-01 16:46:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1068 transitions. [2020-12-01 16:46:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 16:46:17,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:46:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 901 states and 1116 transitions. [2020-12-01 16:46:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1116 transitions. [2020-12-01 16:46:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 16:46:18,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:46:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 948 states and 1165 transitions. [2020-12-01 16:46:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1165 transitions. [2020-12-01 16:46:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 16:46:19,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1019 states and 1236 transitions. [2020-12-01 16:46:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1236 transitions. [2020-12-01 16:46:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-01 16:46:21,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-12-01 16:46:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1050 states and 1268 transitions. [2020-12-01 16:46:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1268 transitions. [2020-12-01 16:46:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-01 16:46:22,878 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-12-01 16:46:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1053 states and 1272 transitions. [2020-12-01 16:46:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1272 transitions. [2020-12-01 16:46:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-01 16:46:23,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-12-01 16:46:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1056 states and 1276 transitions. [2020-12-01 16:46:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1276 transitions. [2020-12-01 16:46:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-01 16:46:23,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-01 16:46:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1079 states and 1300 transitions. [2020-12-01 16:46:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1300 transitions. [2020-12-01 16:46:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-01 16:46:24,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-01 16:46:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1108 states and 1330 transitions. [2020-12-01 16:46:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1330 transitions. [2020-12-01 16:46:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-01 16:46:25,664 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:46:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1109 states and 1347 transitions. [2020-12-01 16:46:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1347 transitions. [2020-12-01 16:46:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-12-01 16:46:26,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 16:46:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1170 states and 1417 transitions. [2020-12-01 16:46:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1417 transitions. [2020-12-01 16:46:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-01 16:46:27,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 16:46:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1191 states and 1443 transitions. [2020-12-01 16:46:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1443 transitions. [2020-12-01 16:46:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-01 16:46:28,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:46:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1193 states and 1445 transitions. [2020-12-01 16:46:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1445 transitions. [2020-12-01 16:46:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-01 16:46:28,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:46:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1194 states and 1446 transitions. [2020-12-01 16:46:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1446 transitions. [2020-12-01 16:46:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 16:46:28,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1233 states and 1486 transitions. [2020-12-01 16:46:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1486 transitions. [2020-12-01 16:46:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-01 16:46:29,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 16:46:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1260 states and 1520 transitions. [2020-12-01 16:46:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1520 transitions. [2020-12-01 16:46:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-01 16:46:30,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-01 16:46:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1285 states and 1546 transitions. [2020-12-01 16:46:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1546 transitions. [2020-12-01 16:46:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-01 16:46:30,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-01 16:46:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1309 states and 1570 transitions. [2020-12-01 16:46:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1570 transitions. [2020-12-01 16:46:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 16:46:31,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1424 states and 1705 transitions. [2020-12-01 16:46:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1705 transitions. [2020-12-01 16:46:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 16:46:35,745 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1537 states and 1830 transitions. [2020-12-01 16:46:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1830 transitions. [2020-12-01 16:46:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 16:46:39,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1539 states and 1831 transitions. [2020-12-01 16:46:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1831 transitions. [2020-12-01 16:46:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-12-01 16:46:39,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:46:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1585 states and 1882 transitions. [2020-12-01 16:46:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1882 transitions. [2020-12-01 16:46:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-12-01 16:46:43,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:46:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1631 states and 1932 transitions. [2020-12-01 16:46:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1932 transitions. [2020-12-01 16:46:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-12-01 16:46:44,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 16:46:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1651 states and 1953 transitions. [2020-12-01 16:46:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1953 transitions. [2020-12-01 16:46:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-12-01 16:46:45,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 160 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 16:46:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1666 states and 1969 transitions. [2020-12-01 16:46:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 1969 transitions. [2020-12-01 16:46:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-01 16:46:46,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-01 16:46:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1685 states and 1990 transitions. [2020-12-01 16:46:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1990 transitions. [2020-12-01 16:46:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-12-01 16:46:47,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-12-01 16:46:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 1704 states and 2010 transitions. [2020-12-01 16:46:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2010 transitions. [2020-12-01 16:46:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-01 16:46:49,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-01 16:46:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 1723 states and 2028 transitions. [2020-12-01 16:46:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2028 transitions. [2020-12-01 16:46:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-01 16:46:50,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 1781 states and 2091 transitions. [2020-12-01 16:46:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2091 transitions. [2020-12-01 16:46:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-01 16:46:51,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1839 states and 2155 transitions. [2020-12-01 16:46:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2155 transitions. [2020-12-01 16:46:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-01 16:46:53,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:46:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1841 states and 2156 transitions. [2020-12-01 16:46:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2156 transitions. [2020-12-01 16:46:54,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-01 16:46:54,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:46:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1843 states and 2158 transitions. [2020-12-01 16:46:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2158 transitions. [2020-12-01 16:46:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-01 16:46:54,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:46:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:46:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 1844 states and 2161 transitions. [2020-12-01 16:46:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2161 transitions. [2020-12-01 16:46:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-12-01 16:46:55,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:46:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:46:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 175 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:47:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 1996 states and 2337 transitions. [2020-12-01 16:47:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2337 transitions. [2020-12-01 16:47:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-01 16:47:01,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 16:47:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2013 states and 2354 transitions. [2020-12-01 16:47:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2354 transitions. [2020-12-01 16:47:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-01 16:47:02,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 16:47:02,587 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2020-12-01 16:47:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2015 states and 2355 transitions. [2020-12-01 16:47:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2355 transitions. [2020-12-01 16:47:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-01 16:47:02,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 16:47:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2034 states and 2373 transitions. [2020-12-01 16:47:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2373 transitions. [2020-12-01 16:47:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-12-01 16:47:03,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:47:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2172 states and 2529 transitions. [2020-12-01 16:47:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2529 transitions. [2020-12-01 16:47:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-12-01 16:47:08,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-01 16:47:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2197 states and 2556 transitions. [2020-12-01 16:47:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 2556 transitions. [2020-12-01 16:47:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-12-01 16:47:08,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-01 16:47:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2221 states and 2580 transitions. [2020-12-01 16:47:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2580 transitions. [2020-12-01 16:47:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-12-01 16:47:09,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:47:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2232 states and 2594 transitions. [2020-12-01 16:47:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2594 transitions. [2020-12-01 16:47:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-12-01 16:47:10,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:47:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2237 states and 2598 transitions. [2020-12-01 16:47:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2598 transitions. [2020-12-01 16:47:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-12-01 16:47:11,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2020-12-01 16:47:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2341 states and 2705 transitions. [2020-12-01 16:47:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2705 transitions. [2020-12-01 16:47:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-12-01 16:47:14,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 16:47:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2399 states and 2762 transitions. [2020-12-01 16:47:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 2762 transitions. [2020-12-01 16:47:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-12-01 16:47:15,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:47:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 16:47:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:47:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2418 states and 2780 transitions. [2020-12-01 16:47:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2780 transitions. [2020-12-01 16:47:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-12-01 16:47:16,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:47:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:47:16,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:47:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:47:16,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:47:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:47:16,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:47:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:47:16,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:47:23,745 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 84 iterations. [2020-12-01 16:47:24,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 04:47:24 ImpRootNode [2020-12-01 16:47:24,141 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 16:47:24,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 16:47:24,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 16:47:24,142 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 16:47:24,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:45:56" (3/4) ... [2020-12-01 16:47:24,145 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 16:47:24,462 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5aa33b36-cf08-47c6-bc13-ced28a05b3ee/bin/ukojak/witness.graphml [2020-12-01 16:47:24,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 16:47:24,463 INFO L168 Benchmark]: Toolchain (without parser) took 90906.81 ms. Allocated memory was 148.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 120.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 210.3 MB. Max. memory is 16.1 GB. [2020-12-01 16:47:24,464 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 86.0 MB. Free memory is still 44.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 16:47:24,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.43 ms. Allocated memory is still 148.9 MB. Free memory was 120.0 MB in the beginning and 109.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 16:47:24,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.29 ms. Allocated memory is still 148.9 MB. Free memory was 109.0 MB in the beginning and 103.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 16:47:24,465 INFO L168 Benchmark]: Boogie Preprocessor took 109.81 ms. Allocated memory is still 148.9 MB. Free memory was 103.1 MB in the beginning and 98.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 16:47:24,466 INFO L168 Benchmark]: RCFGBuilder took 2113.77 ms. Allocated memory was 148.9 MB in the beginning and 188.7 MB in the end (delta: 39.8 MB). Free memory was 98.6 MB in the beginning and 150.5 MB in the end (delta: -51.8 MB). Peak memory consumption was 62.5 MB. Max. memory is 16.1 GB. [2020-12-01 16:47:24,466 INFO L168 Benchmark]: CodeCheck took 87580.01 ms. Allocated memory was 188.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 150.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 159.8 MB. Max. memory is 16.1 GB. [2020-12-01 16:47:24,466 INFO L168 Benchmark]: Witness Printer took 320.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 40.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2020-12-01 16:47:24,470 INFO L339 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. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 87.1s, OverallIterations: 84, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: -1342142944 SDtfs, 195081950 SDslu, 1057219264 SDs, 0 SdLazy, 1101371298 SolverSat, -1669218844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 432.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90711 GetRequests, 87388 SyntacticMatches, 2673 SemanticMatches, 650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315419 ImplicationChecksByTransitivity, 52.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 13162 NumberOfCodeBlocks, 13162 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 12824 ConstructedInterpolants, 0 QuantifiedInterpolants, 8516468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 83 InterpolantComputations, 72 PerfectInterpolantSequences, 11151/11822 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: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] 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] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] 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] [L75] 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] [L82] 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] [L90] 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] [L94] 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] [L102] 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] [L107] 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] [L112] 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] [L118] 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] [L124] 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] [L129] 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] [L134] 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] [L139] 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] [L146] 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] [L150] 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] [L154] 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] [L158] 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] [L162] 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] [L170] 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] [L175] 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] [L183] 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] [L188] 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] [L196] 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] [L199] 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] [L204] 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] [L207] 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] [L213] 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] [L218] 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] [L224] 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] [L228] 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] [L233] 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] [L241] 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] [L248] 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] [L255] 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] [L260] 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] [L266] 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] [L271] 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] [L275] 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] [L278] 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] [L283] 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] [L288] 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] [L296] 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] [L302] 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] [L309] 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] [L316] 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] [L322] 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] [L326] 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] [L328] 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] [L334] 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] [L339] 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] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] 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] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] 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] [L75] 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] [L82] 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] [L90] 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] [L94] 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] [L102] 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] [L107] 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] [L112] 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] [L118] 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] [L124] 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] [L129] 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] [L134] 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] [L139] 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] [L146] 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] [L150] 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] [L154] 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] [L158] 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] [L162] 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] [L170] 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] [L175] 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] [L183] 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] [L188] 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] [L196] 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] [L199] 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] [L204] 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] [L207] 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] [L213] 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] [L218] 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] [L224] 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] [L228] 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] [L233] 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] [L241] 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] [L248] 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] [L255] 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] [L260] 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] [L266] 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] [L271] 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] [L275] 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] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] 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] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] 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] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] 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] [L75] 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] [L82] 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=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] [L90] 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=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] [L94] 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=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] [L102] 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=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] [L107] 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=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] [L112] 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=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] [L118] 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=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] [L124] 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=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] [L129] 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=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] [L134] 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=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] [L139] 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=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] [L146] 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=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] [L150] 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=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] [L154] 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=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] [L158] 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=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] [L162] 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=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] [L170] 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=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] [L175] 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=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] [L183] 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=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] [L188] 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=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] [L196] 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=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] [L199] 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=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] [L204] 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=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] [L207] 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=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] [L213] 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=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] [L218] 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=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] [L224] 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=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] [L228] 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=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] [L233] 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=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] [L241] 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=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] [L248] 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=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] [L255] 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=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] [L260] 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=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] [L266] 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=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] [L271] 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=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] [L275] 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=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] [L278] 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=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] [L283] 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=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] [L288] 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=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] [L296] 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=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] [L302] 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=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] [L309] 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=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] [L316] 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=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] [L322] 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=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] [L326] 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=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] [L328] 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=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] [L334] 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=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] [L339] 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=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] [L343] 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=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] [L347] 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=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] [L355] 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=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] [L363] 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=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] [L365] 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=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] [L371] 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=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] [L373] 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=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] [L375] 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=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] [L382] 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=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] [L387] 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=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] [L392] COND TRUE ((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))))))) [L393] a20 = 0 [L394] a21 = 1 [L395] a8 = 14 [L396] a17 = 0 [L397] a16 = 5 [L398] a7 = 1 [L399] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] 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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] 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)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L434] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem01_label21.c", 4, "reach_error") VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 86.0 MB. Free memory is still 44.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 683.43 ms. Allocated memory is still 148.9 MB. Free memory was 120.0 MB in the beginning and 109.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.29 ms. Allocated memory is still 148.9 MB. Free memory was 109.0 MB in the beginning and 103.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 109.81 ms. Allocated memory is still 148.9 MB. Free memory was 103.1 MB in the beginning and 98.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2113.77 ms. Allocated memory was 148.9 MB in the beginning and 188.7 MB in the end (delta: 39.8 MB). Free memory was 98.6 MB in the beginning and 150.5 MB in the end (delta: -51.8 MB). Peak memory consumption was 62.5 MB. Max. memory is 16.1 GB. * CodeCheck took 87580.01 ms. Allocated memory was 188.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 150.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 159.8 MB. Max. memory is 16.1 GB. * Witness Printer took 320.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 40.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...