./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01168fbb381348520b892fee62d1bbd6a25fcfcb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:03:41,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:03:41,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:03:41,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:03:41,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:03:41,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:03:41,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:03:41,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:03:41,543 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:03:41,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:03:41,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:03:41,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:03:41,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:03:41,546 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:03:41,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:03:41,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:03:41,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:03:41,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:03:41,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:03:41,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:03:41,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:03:41,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:03:41,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:03:41,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:03:41,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:03:41,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:03:41,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:03:41,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:03:41,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:03:41,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:03:41,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:03:41,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:03:41,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:03:41,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:03:41,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:03:41,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:03:41,557 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-03 01:03:41,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:03:41,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:03:41,564 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:03:41,565 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-03 01:03:41,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:03:41,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:03:41,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:03:41,565 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:03:41,565 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:03:41,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:03:41,567 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-03 01:03:41,567 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-03 01:03:41,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:03:41,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:03:41,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-03 01:03:41,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:03:41,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:03:41,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:03:41,568 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-03 01:03:41,568 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:03:41,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:03:41,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01168fbb381348520b892fee62d1bbd6a25fcfcb [2018-12-03 01:03:41,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:03:41,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:03:41,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:03:41,594 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:03:41,595 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:03:41,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-12-03 01:03:41,640 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/data/abf47933b/917c1eae7727421598ea2c65c826df20/FLAGcd8455e84 [2018-12-03 01:03:42,080 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:03:42,081 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-12-03 01:03:42,089 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/data/abf47933b/917c1eae7727421598ea2c65c826df20/FLAGcd8455e84 [2018-12-03 01:03:42,097 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/data/abf47933b/917c1eae7727421598ea2c65c826df20 [2018-12-03 01:03:42,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:03:42,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:03:42,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:03:42,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:03:42,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:03:42,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42, skipping insertion in model container [2018-12-03 01:03:42,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:03:42,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:03:42,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:03:42,327 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:03:42,411 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:03:42,421 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:03:42,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42 WrapperNode [2018-12-03 01:03:42,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:03:42,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:03:42,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:03:42,422 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:03:42,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:03:42,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:03:42,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:03:42,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:03:42,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... [2018-12-03 01:03:42,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:03:42,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:03:42,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:03:42,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:03:42,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-03 01:03:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:03:42,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:03:43,532 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:03:43,532 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-03 01:03:43,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:03:43 BoogieIcfgContainer [2018-12-03 01:03:43,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:03:43,533 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-03 01:03:43,533 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-03 01:03:43,544 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-03 01:03:43,544 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:03:43" (1/1) ... [2018-12-03 01:03:43,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:03:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-03 01:03:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-03 01:03:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 01:03:43,587 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2018-12-03 01:03:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2018-12-03 01:03:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 01:03:44,066 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2018-12-03 01:03:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2018-12-03 01:03:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 01:03:44,430 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 285 states and 378 transitions. [2018-12-03 01:03:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 378 transitions. [2018-12-03 01:03:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 01:03:44,840 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 300 states and 397 transitions. [2018-12-03 01:03:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 397 transitions. [2018-12-03 01:03:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:03:44,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 01:03:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 301 states and 399 transitions. [2018-12-03 01:03:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 399 transitions. [2018-12-03 01:03:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 01:03:45,068 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 321 states and 424 transitions. [2018-12-03 01:03:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 424 transitions. [2018-12-03 01:03:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:03:45,288 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 01:03:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 322 states and 426 transitions. [2018-12-03 01:03:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 426 transitions. [2018-12-03 01:03:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:03:45,438 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 01:03:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 323 states and 428 transitions. [2018-12-03 01:03:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 428 transitions. [2018-12-03 01:03:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 01:03:45,568 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 01:03:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 328 states and 434 transitions. [2018-12-03 01:03:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 434 transitions. [2018-12-03 01:03:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 01:03:45,711 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 342 states and 448 transitions. [2018-12-03 01:03:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 448 transitions. [2018-12-03 01:03:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 01:03:45,913 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 356 states and 469 transitions. [2018-12-03 01:03:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 469 transitions. [2018-12-03 01:03:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 01:03:46,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 01:03:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 385 states and 499 transitions. [2018-12-03 01:03:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 499 transitions. [2018-12-03 01:03:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 01:03:46,533 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:03:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 398 states and 514 transitions. [2018-12-03 01:03:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2018-12-03 01:03:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 01:03:46,709 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-03 01:03:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 407 states and 528 transitions. [2018-12-03 01:03:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 528 transitions. [2018-12-03 01:03:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 01:03:47,124 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 447 states and 577 transitions. [2018-12-03 01:03:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 577 transitions. [2018-12-03 01:03:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 01:03:47,724 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:03:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 452 states and 582 transitions. [2018-12-03 01:03:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 582 transitions. [2018-12-03 01:03:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 01:03:47,768 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-03 01:03:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 466 states and 602 transitions. [2018-12-03 01:03:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 602 transitions. [2018-12-03 01:03:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 01:03:48,230 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 469 states and 605 transitions. [2018-12-03 01:03:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 605 transitions. [2018-12-03 01:03:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 01:03:48,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 01:03:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 470 states and 609 transitions. [2018-12-03 01:03:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 609 transitions. [2018-12-03 01:03:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 01:03:48,643 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 01:03:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 481 states and 620 transitions. [2018-12-03 01:03:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 620 transitions. [2018-12-03 01:03:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 01:03:48,745 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 01:03:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 503 states and 642 transitions. [2018-12-03 01:03:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 642 transitions. [2018-12-03 01:03:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 01:03:48,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-03 01:03:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 528 states and 670 transitions. [2018-12-03 01:03:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 670 transitions. [2018-12-03 01:03:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 01:03:49,472 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 01:03:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 540 states and 686 transitions. [2018-12-03 01:03:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 686 transitions. [2018-12-03 01:03:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 01:03:50,386 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 01:03:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 543 states and 691 transitions. [2018-12-03 01:03:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 691 transitions. [2018-12-03 01:03:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 01:03:50,610 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 01:03:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 569 states and 720 transitions. [2018-12-03 01:03:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 720 transitions. [2018-12-03 01:03:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 01:03:51,265 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 594 states and 749 transitions. [2018-12-03 01:03:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 749 transitions. [2018-12-03 01:03:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 01:03:51,670 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-03 01:03:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 606 states and 762 transitions. [2018-12-03 01:03:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2018-12-03 01:03:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 01:03:51,942 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 613 states and 770 transitions. [2018-12-03 01:03:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 770 transitions. [2018-12-03 01:03:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 01:03:52,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 658 states and 830 transitions. [2018-12-03 01:03:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 830 transitions. [2018-12-03 01:03:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 01:03:53,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 659 states and 832 transitions. [2018-12-03 01:03:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 832 transitions. [2018-12-03 01:03:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 01:03:53,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 679 states and 853 transitions. [2018-12-03 01:03:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 853 transitions. [2018-12-03 01:03:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 01:03:53,756 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 687 states and 861 transitions. [2018-12-03 01:03:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 861 transitions. [2018-12-03 01:03:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 01:03:53,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 688 states and 862 transitions. [2018-12-03 01:03:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 862 transitions. [2018-12-03 01:03:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 01:03:54,156 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:03:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 689 states and 862 transitions. [2018-12-03 01:03:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 862 transitions. [2018-12-03 01:03:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 01:03:54,368 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 754 states and 931 transitions. [2018-12-03 01:03:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 931 transitions. [2018-12-03 01:03:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 01:03:56,629 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:03:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 761 states and 938 transitions. [2018-12-03 01:03:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 938 transitions. [2018-12-03 01:03:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 01:03:56,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:03:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 768 states and 947 transitions. [2018-12-03 01:03:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 947 transitions. [2018-12-03 01:03:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 01:03:56,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:03:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 772 states and 953 transitions. [2018-12-03 01:03:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 953 transitions. [2018-12-03 01:03:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 01:03:57,048 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:03:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:03:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 783 states and 963 transitions. [2018-12-03 01:03:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 963 transitions. [2018-12-03 01:03:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 01:03:57,180 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:03:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:58,912 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-03 01:03:59,857 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-03 01:04:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 840 states and 1025 transitions. [2018-12-03 01:04:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1025 transitions. [2018-12-03 01:04:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 01:04:02,244 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 909 states and 1105 transitions. [2018-12-03 01:04:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1105 transitions. [2018-12-03 01:04:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 01:04:05,944 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 01:04:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 910 states and 1106 transitions. [2018-12-03 01:04:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1106 transitions. [2018-12-03 01:04:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 01:04:06,115 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 955 states and 1151 transitions. [2018-12-03 01:04:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1151 transitions. [2018-12-03 01:04:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 01:04:07,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 958 states and 1154 transitions. [2018-12-03 01:04:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1154 transitions. [2018-12-03 01:04:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 01:04:07,732 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:04:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 969 states and 1172 transitions. [2018-12-03 01:04:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1172 transitions. [2018-12-03 01:04:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 01:04:08,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 971 states and 1174 transitions. [2018-12-03 01:04:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1174 transitions. [2018-12-03 01:04:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 01:04:09,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1039 states and 1243 transitions. [2018-12-03 01:04:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1243 transitions. [2018-12-03 01:04:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 01:04:10,588 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1040 states and 1243 transitions. [2018-12-03 01:04:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1243 transitions. [2018-12-03 01:04:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 01:04:10,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 01:04:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1069 states and 1275 transitions. [2018-12-03 01:04:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1275 transitions. [2018-12-03 01:04:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 01:04:12,078 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:04:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1071 states and 1278 transitions. [2018-12-03 01:04:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1278 transitions. [2018-12-03 01:04:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 01:04:12,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-03 01:04:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1081 states and 1293 transitions. [2018-12-03 01:04:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1293 transitions. [2018-12-03 01:04:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 01:04:13,141 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 140 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:18,793 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-03 01:04:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1140 states and 1369 transitions. [2018-12-03 01:04:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1369 transitions. [2018-12-03 01:04:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 01:04:20,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 01:04:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1143 states and 1376 transitions. [2018-12-03 01:04:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1376 transitions. [2018-12-03 01:04:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 01:04:21,550 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 01:04:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1144 states and 1380 transitions. [2018-12-03 01:04:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1380 transitions. [2018-12-03 01:04:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 01:04:21,806 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:25,149 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 01:04:25,430 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-03 01:04:26,882 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-12-03 01:04:27,211 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-03 01:04:28,868 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-03 01:04:29,265 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-12-03 01:04:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1213 states and 1462 transitions. [2018-12-03 01:04:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1462 transitions. [2018-12-03 01:04:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 01:04:32,602 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1238 states and 1488 transitions. [2018-12-03 01:04:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1488 transitions. [2018-12-03 01:04:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 01:04:34,035 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 01:04:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1247 states and 1503 transitions. [2018-12-03 01:04:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1503 transitions. [2018-12-03 01:04:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 01:04:36,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 01:04:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1280 states and 1539 transitions. [2018-12-03 01:04:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1539 transitions. [2018-12-03 01:04:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 01:04:40,687 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 01:04:41,359 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-03 01:04:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1305 states and 1565 transitions. [2018-12-03 01:04:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1565 transitions. [2018-12-03 01:04:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 01:04:42,758 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-03 01:04:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1309 states and 1572 transitions. [2018-12-03 01:04:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1572 transitions. [2018-12-03 01:04:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 01:04:43,420 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-03 01:04:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1323 states and 1586 transitions. [2018-12-03 01:04:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1586 transitions. [2018-12-03 01:04:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 01:04:44,502 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1392 states and 1665 transitions. [2018-12-03 01:04:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1665 transitions. [2018-12-03 01:04:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 01:04:50,496 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 01:04:52,010 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-03 01:04:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1396 states and 1670 transitions. [2018-12-03 01:04:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1670 transitions. [2018-12-03 01:04:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 01:04:53,977 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:04:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1400 states and 1679 transitions. [2018-12-03 01:04:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1679 transitions. [2018-12-03 01:04:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 01:04:54,717 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-03 01:04:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1402 states and 1684 transitions. [2018-12-03 01:04:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1684 transitions. [2018-12-03 01:04:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 01:04:55,113 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 01:04:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1437 states and 1733 transitions. [2018-12-03 01:04:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1733 transitions. [2018-12-03 01:04:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 01:04:59,183 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:04:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-03 01:04:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:04:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1439 states and 1735 transitions. [2018-12-03 01:04:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1735 transitions. [2018-12-03 01:04:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 01:04:59,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:02,242 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-03 01:05:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:05:06,348 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-03 01:05:07,614 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-03 01:05:08,775 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-03 01:05:10,212 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-12-03 01:05:12,532 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-03 01:05:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1499 states and 1795 transitions. [2018-12-03 01:05:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1795 transitions. [2018-12-03 01:05:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 01:05:13,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 01:05:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1503 states and 1804 transitions. [2018-12-03 01:05:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1804 transitions. [2018-12-03 01:05:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 01:05:13,908 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:16,063 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-12-03 01:05:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 229 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 01:05:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1513 states and 1818 transitions. [2018-12-03 01:05:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1818 transitions. [2018-12-03 01:05:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 01:05:20,700 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 88 proven. 175 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 01:05:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1604 states and 1927 transitions. [2018-12-03 01:05:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1927 transitions. [2018-12-03 01:05:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 01:05:24,813 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-03 01:05:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1624 states and 1959 transitions. [2018-12-03 01:05:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1959 transitions. [2018-12-03 01:05:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 01:05:29,069 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-03 01:05:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1625 states and 1960 transitions. [2018-12-03 01:05:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1960 transitions. [2018-12-03 01:05:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 01:05:29,596 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:05:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1644 states and 1986 transitions. [2018-12-03 01:05:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1986 transitions. [2018-12-03 01:05:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 01:05:31,434 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:05:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1655 states and 1999 transitions. [2018-12-03 01:05:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1999 transitions. [2018-12-03 01:05:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 01:05:33,250 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:05:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 1659 states and 2006 transitions. [2018-12-03 01:05:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2006 transitions. [2018-12-03 01:05:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 01:05:33,629 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 01:05:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 1686 states and 2047 transitions. [2018-12-03 01:05:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2047 transitions. [2018-12-03 01:05:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 01:05:40,965 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 01:05:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1687 states and 2048 transitions. [2018-12-03 01:05:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2048 transitions. [2018-12-03 01:05:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 01:05:41,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 01:05:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1688 states and 2051 transitions. [2018-12-03 01:05:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2051 transitions. [2018-12-03 01:05:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 01:05:41,786 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 01:05:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 1712 states and 2075 transitions. [2018-12-03 01:05:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2075 transitions. [2018-12-03 01:05:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-03 01:05:43,376 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-03 01:05:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 1754 states and 2130 transitions. [2018-12-03 01:05:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2130 transitions. [2018-12-03 01:05:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-03 01:05:47,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 01:05:51,726 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-03 01:05:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1785 states and 2164 transitions. [2018-12-03 01:05:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2164 transitions. [2018-12-03 01:05:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-03 01:05:56,033 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 01:05:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1786 states and 2164 transitions. [2018-12-03 01:05:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2164 transitions. [2018-12-03 01:05:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-03 01:05:56,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:05:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 01:05:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:05:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1815 states and 2192 transitions. [2018-12-03 01:05:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2192 transitions. [2018-12-03 01:05:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-03 01:05:59,389 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:05:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 329 proven. 55 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 01:06:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1851 states and 2244 transitions. [2018-12-03 01:06:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2244 transitions. [2018-12-03 01:06:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-03 01:06:04,405 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-03 01:06:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1852 states and 2244 transitions. [2018-12-03 01:06:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2244 transitions. [2018-12-03 01:06:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-03 01:06:04,806 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-03 01:06:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1859 states and 2251 transitions. [2018-12-03 01:06:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2251 transitions. [2018-12-03 01:06:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-03 01:06:05,459 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:06:14,006 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-03 01:06:18,064 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-03 01:06:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 1910 states and 2304 transitions. [2018-12-03 01:06:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2304 transitions. [2018-12-03 01:06:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-03 01:06:19,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:06:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1932 states and 2325 transitions. [2018-12-03 01:06:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2325 transitions. [2018-12-03 01:06:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 01:06:24,527 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-03 01:06:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 1933 states and 2328 transitions. [2018-12-03 01:06:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2328 transitions. [2018-12-03 01:06:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 01:06:24,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-03 01:06:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 1974 states and 2367 transitions. [2018-12-03 01:06:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2367 transitions. [2018-12-03 01:06:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 01:06:30,116 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-03 01:06:31,997 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-12-03 01:06:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2013 states and 2405 transitions. [2018-12-03 01:06:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2405 transitions. [2018-12-03 01:06:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-03 01:06:37,561 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-03 01:06:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2017 states and 2412 transitions. [2018-12-03 01:06:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2412 transitions. [2018-12-03 01:06:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-03 01:06:39,307 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-03 01:06:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2018 states and 2413 transitions. [2018-12-03 01:06:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2413 transitions. [2018-12-03 01:06:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-03 01:06:40,380 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 01:06:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2089 states and 2496 transitions. [2018-12-03 01:06:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2496 transitions. [2018-12-03 01:06:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-03 01:06:51,522 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 01:06:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2128 states and 2538 transitions. [2018-12-03 01:06:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2538 transitions. [2018-12-03 01:06:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-03 01:06:56,391 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 01:06:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2129 states and 2541 transitions. [2018-12-03 01:06:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2541 transitions. [2018-12-03 01:06:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-03 01:06:57,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 01:06:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:06:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2132 states and 2544 transitions. [2018-12-03 01:06:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2544 transitions. [2018-12-03 01:06:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-03 01:06:57,879 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:06:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:06:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 217 proven. 101 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 01:07:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:07:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2171 states and 2593 transitions. [2018-12-03 01:07:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2593 transitions. [2018-12-03 01:07:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 01:07:03,324 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:07:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:07:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:07:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:07:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:07:03,540 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 100 iterations. [2018-12-03 01:07:03,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 01:07:03 ImpRootNode [2018-12-03 01:07:03,643 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-03 01:07:03,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:07:03,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:07:03,644 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:07:03,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:03:43" (3/4) ... [2018-12-03 01:07:03,646 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 01:07:03,728 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7803c772-568e-498d-809a-498d89d95e85/bin-2019/ukojak/witness.graphml [2018-12-03 01:07:03,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:07:03,728 INFO L168 Benchmark]: Toolchain (without parser) took 201629.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 433.6 MB). Free memory was 944.2 MB in the beginning and 650.5 MB in the end (delta: 293.7 MB). Peak memory consumption was 727.3 MB. Max. memory is 11.5 GB. [2018-12-03 01:07:03,729 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:07:03,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-12-03 01:07:03,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:07:03,729 INFO L168 Benchmark]: Boogie Preprocessor took 30.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:07:03,730 INFO L168 Benchmark]: RCFGBuilder took 1041.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 876.5 MB in the end (delta: 212.5 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:07:03,730 INFO L168 Benchmark]: CodeCheck took 200110.08 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 876.5 MB in the beginning and 685.0 MB in the end (delta: 191.6 MB). Peak memory consumption was 513.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:07:03,730 INFO L168 Benchmark]: Witness Printer took 84.41 ms. Allocated memory is still 1.5 GB. Free memory was 685.0 MB in the beginning and 650.5 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:07:03,732 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 199.9s OverallTime, 100 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1779437640 SDtfs, -1291902220 SDslu, -778433108 SDs, 0 SdLazy, 689056510 SolverSat, 494818162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 369.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110087 GetRequests, 106520 SyntacticMatches, 2279 SemanticMatches, 1288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237822 ImplicationChecksByTransitivity, 181.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 16884 NumberOfCodeBlocks, 16884 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 16542 ConstructedInterpolants, 0 QuantifiedInterpolants, 14777664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 80 PerfectInterpolantSequences, 16280/16801 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 398]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L130] a8 = 15 [L131] a17 = 0 [L132] a21 = 1 [L133] a20 = 0 [L134] a16 = 4 [L135] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND 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=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(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=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((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=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(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=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1041.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 876.5 MB in the end (delta: 212.5 MB). Peak memory consumption was 212.5 MB. Max. memory is 11.5 GB. * CodeCheck took 200110.08 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 876.5 MB in the beginning and 685.0 MB in the end (delta: 191.6 MB). Peak memory consumption was 513.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.41 ms. Allocated memory is still 1.5 GB. Free memory was 685.0 MB in the beginning and 650.5 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...