./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.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_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/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 d05e9f9e8f56372d1ec6006225ca371c44b7373b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:11:03,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 18:11:03,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 18:11:03,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 18:11:03,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 18:11:03,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 18:11:03,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 18:11:03,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 18:11:03,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 18:11:03,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 18:11:03,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 18:11:03,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 18:11:03,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 18:11:03,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 18:11:03,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 18:11:03,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 18:11:03,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 18:11:03,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 18:11:03,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 18:11:03,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 18:11:03,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 18:11:03,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 18:11:03,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 18:11:03,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 18:11:03,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 18:11:03,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 18:11:03,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 18:11:03,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 18:11:03,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 18:11:03,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 18:11:03,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 18:11:03,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 18:11:03,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 18:11:03,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 18:11:03,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 18:11:03,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 18:11:03,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 18:11:03,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 18:11:03,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 18:11:03,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 18:11:03,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 18:11:03,550 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 18:11:03,589 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 18:11:03,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 18:11:03,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 18:11:03,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 18:11:03,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 18:11:03,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 18:11:03,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 18:11:03,593 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 18:11:03,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 18:11:03,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 18:11:03,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 18:11:03,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 18:11:03,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 18:11:03,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 18:11:03,595 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 18:11:03,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 18:11:03,595 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 18:11:03,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 18:11:03,596 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 18:11:03,596 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 18:11:03,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 18:11:03,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 18:11:03,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 18:11:03,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 18:11:03,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 18:11:03,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 18:11:03,598 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 18:11:03,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 18:11:03,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 18:11:03,599 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_dadfe223-8c14-4b36-aab6-47adbf494462/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_dadfe223-8c14-4b36-aab6-47adbf494462/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 -> d05e9f9e8f56372d1ec6006225ca371c44b7373b [2020-12-01 18:11:03,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 18:11:03,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 18:11:03,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 18:11:03,992 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 18:11:03,995 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 18:11:03,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2020-12-01 18:11:04,121 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/data/912d6f2da/833ea2ba46494840b6b8055fc071f3e2/FLAG1a3a698f0 [2020-12-01 18:11:04,792 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 18:11:04,792 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2020-12-01 18:11:04,809 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/data/912d6f2da/833ea2ba46494840b6b8055fc071f3e2/FLAG1a3a698f0 [2020-12-01 18:11:05,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/data/912d6f2da/833ea2ba46494840b6b8055fc071f3e2 [2020-12-01 18:11:05,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 18:11:05,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 18:11:05,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 18:11:05,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 18:11:05,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 18:11:05,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:05,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc98e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05, skipping insertion in model container [2020-12-01 18:11:05,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:05,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 18:11:05,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 18:11:05,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:11:05,686 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 18:11:05,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 18:11:05,897 INFO L208 MainTranslator]: Completed translation [2020-12-01 18:11:05,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05 WrapperNode [2020-12-01 18:11:05,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 18:11:05,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 18:11:05,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 18:11:05,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 18:11:05,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:05,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 18:11:06,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 18:11:06,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 18:11:06,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 18:11:06,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... [2020-12-01 18:11:06,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 18:11:06,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 18:11:06,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 18:11:06,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 18:11:06,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:11:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/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 18:11:06,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 18:11:06,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 18:11:06,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 18:11:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 18:11:08,874 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 18:11:08,874 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-01 18:11:08,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:11:08 BoogieIcfgContainer [2020-12-01 18:11:08,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 18:11:08,880 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 18:11:08,881 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 18:11:08,894 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 18:11:08,895 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:11:08" (1/1) ... [2020-12-01 18:11:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 18:11:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-12-01 18:11:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-12-01 18:11:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 18:11:08,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:09,533 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 18:11:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2020-12-01 18:11:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2020-12-01 18:11:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 18:11:10,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:11:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2020-12-01 18:11:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2020-12-01 18:11:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 18:11:10,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:11,041 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 18:11:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 151 states and 228 transitions. [2020-12-01 18:11:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2020-12-01 18:11:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 18:11:11,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 221 states and 300 transitions. [2020-12-01 18:11:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 300 transitions. [2020-12-01 18:11:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-01 18:11:12,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 228 states and 310 transitions. [2020-12-01 18:11:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 310 transitions. [2020-12-01 18:11:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-01 18:11:12,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 239 states and 328 transitions. [2020-12-01 18:11:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 328 transitions. [2020-12-01 18:11:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-01 18:11:13,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 244 states and 333 transitions. [2020-12-01 18:11:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 333 transitions. [2020-12-01 18:11:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-01 18:11:13,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 249 states and 338 transitions. [2020-12-01 18:11:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2020-12-01 18:11:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-01 18:11:13,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 257 states and 348 transitions. [2020-12-01 18:11:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2020-12-01 18:11:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 18:11:14,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:11:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 270 states and 365 transitions. [2020-12-01 18:11:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 365 transitions. [2020-12-01 18:11:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 18:11:15,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:11:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 275 states and 370 transitions. [2020-12-01 18:11:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2020-12-01 18:11:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-01 18:11:15,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 280 states and 375 transitions. [2020-12-01 18:11:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 375 transitions. [2020-12-01 18:11:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-01 18:11:15,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 284 states and 379 transitions. [2020-12-01 18:11:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 379 transitions. [2020-12-01 18:11:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-01 18:11:15,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 295 states and 393 transitions. [2020-12-01 18:11:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2020-12-01 18:11:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-01 18:11:16,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 318 states and 428 transitions. [2020-12-01 18:11:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 428 transitions. [2020-12-01 18:11:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-01 18:11:18,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 323 states and 433 transitions. [2020-12-01 18:11:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 433 transitions. [2020-12-01 18:11:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-01 18:11:18,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 18:11:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 324 states and 435 transitions. [2020-12-01 18:11:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 435 transitions. [2020-12-01 18:11:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 18:11:18,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 327 states and 439 transitions. [2020-12-01 18:11:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 439 transitions. [2020-12-01 18:11:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-01 18:11:19,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:11:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 342 states and 457 transitions. [2020-12-01 18:11:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 457 transitions. [2020-12-01 18:11:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 18:11:20,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 361 states and 479 transitions. [2020-12-01 18:11:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 479 transitions. [2020-12-01 18:11:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-01 18:11:21,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 382 states and 504 transitions. [2020-12-01 18:11:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 504 transitions. [2020-12-01 18:11:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-01 18:11:22,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:11:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 405 states and 533 transitions. [2020-12-01 18:11:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 533 transitions. [2020-12-01 18:11:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-01 18:11:24,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 419 states and 548 transitions. [2020-12-01 18:11:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 548 transitions. [2020-12-01 18:11:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-01 18:11:24,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 436 states and 567 transitions. [2020-12-01 18:11:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 567 transitions. [2020-12-01 18:11:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 18:11:25,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 18:11:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 447 states and 580 transitions. [2020-12-01 18:11:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 580 transitions. [2020-12-01 18:11:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-01 18:11:25,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 461 states and 596 transitions. [2020-12-01 18:11:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 596 transitions. [2020-12-01 18:11:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 18:11:26,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 478 states and 616 transitions. [2020-12-01 18:11:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 616 transitions. [2020-12-01 18:11:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 18:11:27,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 486 states and 627 transitions. [2020-12-01 18:11:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 627 transitions. [2020-12-01 18:11:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 18:11:27,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 18:11:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 493 states and 636 transitions. [2020-12-01 18:11:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 636 transitions. [2020-12-01 18:11:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 18:11:27,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 498 states and 643 transitions. [2020-12-01 18:11:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 643 transitions. [2020-12-01 18:11:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 18:11:28,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 18:11:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 501 states and 647 transitions. [2020-12-01 18:11:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 647 transitions. [2020-12-01 18:11:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 18:11:28,555 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 513 states and 661 transitions. [2020-12-01 18:11:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 661 transitions. [2020-12-01 18:11:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-01 18:11:28,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 525 states and 675 transitions. [2020-12-01 18:11:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 675 transitions. [2020-12-01 18:11:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:11:29,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 538 states and 695 transitions. [2020-12-01 18:11:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 695 transitions. [2020-12-01 18:11:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:11:30,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 543 states and 700 transitions. [2020-12-01 18:11:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 700 transitions. [2020-12-01 18:11:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 18:11:31,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 562 states and 721 transitions. [2020-12-01 18:11:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 721 transitions. [2020-12-01 18:11:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-01 18:11:31,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 581 states and 741 transitions. [2020-12-01 18:11:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 741 transitions. [2020-12-01 18:11:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-01 18:11:32,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 586 states and 749 transitions. [2020-12-01 18:11:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 749 transitions. [2020-12-01 18:11:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-01 18:11:32,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 605 states and 769 transitions. [2020-12-01 18:11:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 769 transitions. [2020-12-01 18:11:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 18:11:32,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 650 states and 820 transitions. [2020-12-01 18:11:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 820 transitions. [2020-12-01 18:11:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 18:11:35,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 18:11:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 655 states and 825 transitions. [2020-12-01 18:11:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 825 transitions. [2020-12-01 18:11:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-01 18:11:35,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 660 states and 832 transitions. [2020-12-01 18:11:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 832 transitions. [2020-12-01 18:11:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-01 18:11:36,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-01 18:11:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 675 states and 847 transitions. [2020-12-01 18:11:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 847 transitions. [2020-12-01 18:11:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 18:11:36,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:36,742 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 18:11:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 815 states and 997 transitions. [2020-12-01 18:11:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 997 transitions. [2020-12-01 18:11:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-01 18:11:39,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 18:11:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 818 states and 1001 transitions. [2020-12-01 18:11:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1001 transitions. [2020-12-01 18:11:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-01 18:11:39,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 18:11:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 819 states and 1001 transitions. [2020-12-01 18:11:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1001 transitions. [2020-12-01 18:11:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:11:40,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 873 states and 1070 transitions. [2020-12-01 18:11:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1070 transitions. [2020-12-01 18:11:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:11:43,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 890 states and 1087 transitions. [2020-12-01 18:11:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1087 transitions. [2020-12-01 18:11:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:11:44,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 18:11:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 909 states and 1107 transitions. [2020-12-01 18:11:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1107 transitions. [2020-12-01 18:11:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:11:44,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 81 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 944 states and 1154 transitions. [2020-12-01 18:11:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1154 transitions. [2020-12-01 18:11:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:11:46,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 81 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 963 states and 1178 transitions. [2020-12-01 18:11:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1178 transitions. [2020-12-01 18:11:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 18:11:48,011 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 81 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 972 states and 1186 transitions. [2020-12-01 18:11:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1186 transitions. [2020-12-01 18:11:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 18:11:48,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:48,899 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 18:11:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1043 states and 1257 transitions. [2020-12-01 18:11:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1257 transitions. [2020-12-01 18:11:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-01 18:11:50,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1058 states and 1274 transitions. [2020-12-01 18:11:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1274 transitions. [2020-12-01 18:11:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-01 18:11:52,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1060 states and 1278 transitions. [2020-12-01 18:11:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1278 transitions. [2020-12-01 18:11:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 18:11:52,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 18:11:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1068 states and 1289 transitions. [2020-12-01 18:11:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1289 transitions. [2020-12-01 18:11:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-01 18:11:53,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 95 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:11:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1079 states and 1308 transitions. [2020-12-01 18:11:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1308 transitions. [2020-12-01 18:11:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-01 18:11:56,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-12-01 18:11:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1084 states and 1315 transitions. [2020-12-01 18:11:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1315 transitions. [2020-12-01 18:11:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-01 18:11:56,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:11:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:11:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:11:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:11:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1147 states and 1397 transitions. [2020-12-01 18:11:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1397 transitions. [2020-12-01 18:11:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-01 18:11:59,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:12:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:12:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 120 proven. 58 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 18:12:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:12:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1169 states and 1425 transitions. [2020-12-01 18:12:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1425 transitions. [2020-12-01 18:12:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-01 18:12:02,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:12:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:12:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:12:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:12:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1187 states and 1446 transitions. [2020-12-01 18:12:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1446 transitions. [2020-12-01 18:12:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-01 18:12:04,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:12:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:12:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:12:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:12:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1188 states and 1446 transitions. [2020-12-01 18:12:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1446 transitions. [2020-12-01 18:12:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-01 18:12:05,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:12:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:12:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 18:12:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:12:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1203 states and 1465 transitions. [2020-12-01 18:12:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1465 transitions. [2020-12-01 18:12:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-01 18:12:06,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:12:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:12:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 115 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-01 18:12:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:12:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1220 states and 1483 transitions. [2020-12-01 18:12:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1483 transitions. [2020-12-01 18:12:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-01 18:12:07,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:12:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:12:07,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:12:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:12:07,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:12:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:12:08,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:12:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:12:08,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:12:11,662 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 65 iterations. [2020-12-01 18:12:11,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:12:11 ImpRootNode [2020-12-01 18:12:11,912 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 18:12:11,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 18:12:11,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 18:12:11,913 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 18:12:11,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:11:08" (3/4) ... [2020-12-01 18:12:11,916 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 18:12:12,131 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dadfe223-8c14-4b36-aab6-47adbf494462/bin/ukojak/witness.graphml [2020-12-01 18:12:12,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 18:12:12,133 INFO L168 Benchmark]: Toolchain (without parser) took 67074.96 ms. Allocated memory was 83.9 MB in the beginning and 1.0 GB in the end (delta: 947.9 MB). Free memory was 53.5 MB in the beginning and 627.9 MB in the end (delta: -574.4 MB). Peak memory consumption was 372.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:12:12,134 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 83.9 MB. Free memory was 41.5 MB in the beginning and 41.5 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 18:12:12,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.96 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 53.3 MB in the beginning and 60.9 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 18:12:12,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.02 ms. Allocated memory is still 100.7 MB. Free memory was 60.9 MB in the beginning and 55.2 MB in the end (delta: 5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 18:12:12,136 INFO L168 Benchmark]: Boogie Preprocessor took 83.38 ms. Allocated memory is still 100.7 MB. Free memory was 55.2 MB in the beginning and 51.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:12:12,136 INFO L168 Benchmark]: RCFGBuilder took 2763.68 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 51.0 MB in the beginning and 55.3 MB in the end (delta: -4.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:12:12,137 INFO L168 Benchmark]: CodeCheck took 63031.91 ms. Allocated memory was 125.8 MB in the beginning and 1.0 GB in the end (delta: 906.0 MB). Free memory was 55.3 MB in the beginning and 656.5 MB in the end (delta: -601.2 MB). Peak memory consumption was 304.8 MB. Max. memory is 16.1 GB. [2020-12-01 18:12:12,137 INFO L168 Benchmark]: Witness Printer took 218.29 ms. Allocated memory is still 1.0 GB. Free memory was 656.5 MB in the beginning and 627.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-12-01 18:12:12,142 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: 62.7s, OverallIterations: 65, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: -2071418872 SDtfs, -729990108 SDslu, -1628080592 SDs, 0 SdLazy, -1308186538 SolverSat, -1817449174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 214.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51775 GetRequests, 49791 SyntacticMatches, 1490 SemanticMatches, 494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165919 ImplicationChecksByTransitivity, 41.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 7954 NumberOfCodeBlocks, 7954 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 7715 ConstructedInterpolants, 0 QuantifiedInterpolants, 5266284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 36 PerfectInterpolantSequences, 3734/4473 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 TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [a=1, a12=8, a16=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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 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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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=5, 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] [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=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 TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L276] a17 = 0 [L277] return 24; VAL [a=1, a12=8, a16=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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 TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L323] a8 = 13 [L324] a16 = 4 [L325] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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))) [L434] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L437] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem01_label44.c", 4, "reach_error") VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 83.9 MB. Free memory was 41.5 MB in the beginning and 41.5 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 839.96 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 53.3 MB in the beginning and 60.9 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 131.02 ms. Allocated memory is still 100.7 MB. Free memory was 60.9 MB in the beginning and 55.2 MB in the end (delta: 5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 83.38 ms. Allocated memory is still 100.7 MB. Free memory was 55.2 MB in the beginning and 51.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2763.68 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 51.0 MB in the beginning and 55.3 MB in the end (delta: -4.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. * CodeCheck took 63031.91 ms. Allocated memory was 125.8 MB in the beginning and 1.0 GB in the end (delta: 906.0 MB). Free memory was 55.3 MB in the beginning and 656.5 MB in the end (delta: -601.2 MB). Peak memory consumption was 304.8 MB. Max. memory is 16.1 GB. * Witness Printer took 218.29 ms. Allocated memory is still 1.0 GB. Free memory was 656.5 MB in the beginning and 627.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...