./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/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 08b7aa26e03024d3f4d1247f9fe7868985d0c8c2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-10-26 22:42:28,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:42:28,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:42:28,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:42:28,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:42:28,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:42:28,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:42:28,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:42:28,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:42:28,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:42:28,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:42:28,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:42:28,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:42:28,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:42:28,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:42:28,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:42:28,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:42:28,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:42:28,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:42:28,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:42:28,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:42:28,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:42:28,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:42:28,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:42:28,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:42:28,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:42:28,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:42:28,443 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:42:28,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:42:28,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:42:28,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:42:28,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:42:28,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:42:28,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:42:28,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:42:28,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:42:28,447 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 22:42:28,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:42:28,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:42:28,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:42:28,462 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:42:28,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:42:28,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:42:28,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:42:28,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:42:28,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:42:28,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:42:28,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:42:28,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:42:28,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:42:28,464 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:42:28,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:42:28,464 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:42:28,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:42:28,464 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 22:42:28,465 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 22:42:28,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:42:28,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:42:28,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 22:42:28,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:42:28,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:42:28,465 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:42:28,466 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 22:42:28,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:42:28,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:42:28,468 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_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/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 -> 08b7aa26e03024d3f4d1247f9fe7868985d0c8c2 [2018-10-26 22:42:28,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:42:28,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:42:28,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:42:28,514 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:42:28,514 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:42:28,515 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c [2018-10-26 22:42:28,557 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/data/b557413ba/1f636df0d57947fb898bac181bce9058/FLAG55b9d61ea [2018-10-26 22:42:28,996 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:42:28,997 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c [2018-10-26 22:42:29,006 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/data/b557413ba/1f636df0d57947fb898bac181bce9058/FLAG55b9d61ea [2018-10-26 22:42:29,017 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/data/b557413ba/1f636df0d57947fb898bac181bce9058 [2018-10-26 22:42:29,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:42:29,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:42:29,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:42:29,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:42:29,025 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:42:29,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267e2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29, skipping insertion in model container [2018-10-26 22:42:29,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:42:29,075 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:42:29,375 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:42:29,378 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:42:29,459 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:42:29,472 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:42:29,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29 WrapperNode [2018-10-26 22:42:29,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:42:29,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:42:29,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:42:29,473 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:42:29,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:42:29,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:42:29,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:42:29,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:42:29,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... [2018-10-26 22:42:29,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:42:29,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:42:29,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:42:29,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:42:29,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:42:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/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-10-26 22:42:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 22:42:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:42:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:42:33,581 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:42:33,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:42:33 BoogieIcfgContainer [2018-10-26 22:42:33,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:42:33,583 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 22:42:33,583 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 22:42:33,593 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 22:42:33,593 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:42:33" (1/1) ... [2018-10-26 22:42:33,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:42:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-10-26 22:42:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-10-26 22:42:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 22:42:33,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 147 states and 222 transitions. [2018-10-26 22:42:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-10-26 22:42:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 22:42:35,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:42:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 148 states and 223 transitions. [2018-10-26 22:42:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2018-10-26 22:42:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 22:42:35,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 154 states and 233 transitions. [2018-10-26 22:42:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 233 transitions. [2018-10-26 22:42:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:42:35,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 225 states and 307 transitions. [2018-10-26 22:42:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2018-10-26 22:42:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 22:42:36,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 233 states and 319 transitions. [2018-10-26 22:42:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 319 transitions. [2018-10-26 22:42:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:42:37,096 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2018-10-26 22:42:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2018-10-26 22:42:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:42:37,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 246 states and 340 transitions. [2018-10-26 22:42:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 340 transitions. [2018-10-26 22:42:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:42:37,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 248 states and 342 transitions. [2018-10-26 22:42:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 342 transitions. [2018-10-26 22:42:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 22:42:38,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 253 states and 347 transitions. [2018-10-26 22:42:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 347 transitions. [2018-10-26 22:42:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 22:42:38,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:42:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 262 states and 358 transitions. [2018-10-26 22:42:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2018-10-26 22:42:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 22:42:38,646 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:42:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 263 states and 360 transitions. [2018-10-26 22:42:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 360 transitions. [2018-10-26 22:42:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 22:42:38,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:42:39,303 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 22:42:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 267 states and 365 transitions. [2018-10-26 22:42:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 365 transitions. [2018-10-26 22:42:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 22:42:39,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:42:39,942 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 22:42:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 269 states and 366 transitions. [2018-10-26 22:42:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 366 transitions. [2018-10-26 22:42:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 22:42:40,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 272 states and 370 transitions. [2018-10-26 22:42:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 370 transitions. [2018-10-26 22:42:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 22:42:40,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:42:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 277 states and 375 transitions. [2018-10-26 22:42:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 375 transitions. [2018-10-26 22:42:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 22:42:40,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 278 states and 376 transitions. [2018-10-26 22:42:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 376 transitions. [2018-10-26 22:42:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 22:42:40,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 293 states and 398 transitions. [2018-10-26 22:42:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 398 transitions. [2018-10-26 22:42:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 22:42:41,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:42,359 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 22:42:43,387 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:42:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 317 states and 430 transitions. [2018-10-26 22:42:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 430 transitions. [2018-10-26 22:42:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 22:42:44,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 321 states and 435 transitions. [2018-10-26 22:42:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 435 transitions. [2018-10-26 22:42:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 22:42:45,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:42:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 323 states and 436 transitions. [2018-10-26 22:42:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 436 transitions. [2018-10-26 22:42:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 22:42:45,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:42:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 324 states and 438 transitions. [2018-10-26 22:42:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 438 transitions. [2018-10-26 22:42:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 22:42:45,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:42:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 326 states and 440 transitions. [2018-10-26 22:42:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 440 transitions. [2018-10-26 22:42:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-26 22:42:45,694 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:42:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 337 states and 453 transitions. [2018-10-26 22:42:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 453 transitions. [2018-10-26 22:42:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 22:42:46,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:42:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 340 states and 456 transitions. [2018-10-26 22:42:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 456 transitions. [2018-10-26 22:42:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 22:42:46,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:42:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 342 states and 458 transitions. [2018-10-26 22:42:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 458 transitions. [2018-10-26 22:42:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 22:42:46,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:42:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 351 states and 469 transitions. [2018-10-26 22:42:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 469 transitions. [2018-10-26 22:42:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 22:42:47,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 376 states and 499 transitions. [2018-10-26 22:42:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 499 transitions. [2018-10-26 22:42:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 22:42:49,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 391 states and 518 transitions. [2018-10-26 22:42:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 518 transitions. [2018-10-26 22:42:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 22:42:49,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 417 states and 549 transitions. [2018-10-26 22:42:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 549 transitions. [2018-10-26 22:42:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 22:42:50,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 431 states and 568 transitions. [2018-10-26 22:42:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2018-10-26 22:42:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 22:42:52,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:42:53,528 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-26 22:42:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 434 states and 573 transitions. [2018-10-26 22:42:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 573 transitions. [2018-10-26 22:42:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 22:42:53,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:42:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 448 states and 588 transitions. [2018-10-26 22:42:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 588 transitions. [2018-10-26 22:42:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 22:42:55,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:42:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 454 states and 595 transitions. [2018-10-26 22:42:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 595 transitions. [2018-10-26 22:42:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 22:42:55,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:42:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 455 states and 596 transitions. [2018-10-26 22:42:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 596 transitions. [2018-10-26 22:42:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 22:42:55,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:42:57,035 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-26 22:42:58,755 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 22:42:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 458 states and 600 transitions. [2018-10-26 22:42:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 600 transitions. [2018-10-26 22:42:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 22:42:59,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:42:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:42:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 465 states and 610 transitions. [2018-10-26 22:42:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 610 transitions. [2018-10-26 22:42:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 22:42:59,733 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:42:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:42:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:43:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 474 states and 619 transitions. [2018-10-26 22:43:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 619 transitions. [2018-10-26 22:43:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 22:43:00,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:43:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 475 states and 620 transitions. [2018-10-26 22:43:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2018-10-26 22:43:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 22:43:00,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 524 states and 676 transitions. [2018-10-26 22:43:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 676 transitions. [2018-10-26 22:43:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 22:43:02,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:43:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 534 states and 694 transitions. [2018-10-26 22:43:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 694 transitions. [2018-10-26 22:43:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 22:43:03,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 583 states and 747 transitions. [2018-10-26 22:43:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 747 transitions. [2018-10-26 22:43:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 22:43:05,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 600 states and 766 transitions. [2018-10-26 22:43:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 766 transitions. [2018-10-26 22:43:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 22:43:06,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 605 states and 774 transitions. [2018-10-26 22:43:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 774 transitions. [2018-10-26 22:43:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 22:43:06,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:43:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 655 states and 831 transitions. [2018-10-26 22:43:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 831 transitions. [2018-10-26 22:43:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 22:43:07,939 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:43:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 665 states and 850 transitions. [2018-10-26 22:43:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 850 transitions. [2018-10-26 22:43:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 22:43:09,504 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:43:10,288 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-10-26 22:43:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 715 states and 907 transitions. [2018-10-26 22:43:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 907 transitions. [2018-10-26 22:43:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 22:43:12,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 22:43:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 746 states and 947 transitions. [2018-10-26 22:43:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 947 transitions. [2018-10-26 22:43:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 22:43:15,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 22:43:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 750 states and 950 transitions. [2018-10-26 22:43:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 950 transitions. [2018-10-26 22:43:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 22:43:15,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:43:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 767 states and 968 transitions. [2018-10-26 22:43:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 968 transitions. [2018-10-26 22:43:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 22:43:16,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:43:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 769 states and 970 transitions. [2018-10-26 22:43:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 970 transitions. [2018-10-26 22:43:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 22:43:16,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 792 states and 1004 transitions. [2018-10-26 22:43:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1004 transitions. [2018-10-26 22:43:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 22:43:17,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 796 states and 1009 transitions. [2018-10-26 22:43:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1009 transitions. [2018-10-26 22:43:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 22:43:18,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 114 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:43:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 805 states and 1021 transitions. [2018-10-26 22:43:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1021 transitions. [2018-10-26 22:43:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 22:43:20,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 114 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:43:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 827 states and 1046 transitions. [2018-10-26 22:43:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1046 transitions. [2018-10-26 22:43:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 22:43:22,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 114 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:43:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 832 states and 1051 transitions. [2018-10-26 22:43:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1051 transitions. [2018-10-26 22:43:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 22:43:23,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:43:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 857 states and 1078 transitions. [2018-10-26 22:43:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1078 transitions. [2018-10-26 22:43:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 22:43:25,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 22:43:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 858 states and 1079 transitions. [2018-10-26 22:43:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1079 transitions. [2018-10-26 22:43:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 22:43:25,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 22:43:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 859 states and 1079 transitions. [2018-10-26 22:43:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1079 transitions. [2018-10-26 22:43:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 22:43:25,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:43:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 862 states and 1083 transitions. [2018-10-26 22:43:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1083 transitions. [2018-10-26 22:43:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 22:43:26,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:43:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 866 states and 1088 transitions. [2018-10-26 22:43:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1088 transitions. [2018-10-26 22:43:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 22:43:26,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:43:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 868 states and 1089 transitions. [2018-10-26 22:43:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1089 transitions. [2018-10-26 22:43:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 22:43:26,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 22:43:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 878 states and 1105 transitions. [2018-10-26 22:43:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1105 transitions. [2018-10-26 22:43:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 22:43:28,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:43:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 948 states and 1185 transitions. [2018-10-26 22:43:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1185 transitions. [2018-10-26 22:43:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 22:43:31,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:43:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 949 states and 1187 transitions. [2018-10-26 22:43:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1187 transitions. [2018-10-26 22:43:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-26 22:43:31,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 969 states and 1214 transitions. [2018-10-26 22:43:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1214 transitions. [2018-10-26 22:43:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 22:43:33,504 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 22:43:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1027 states and 1275 transitions. [2018-10-26 22:43:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1275 transitions. [2018-10-26 22:43:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-26 22:43:34,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 22:43:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1028 states and 1275 transitions. [2018-10-26 22:43:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1275 transitions. [2018-10-26 22:43:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 22:43:35,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:43:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1095 states and 1350 transitions. [2018-10-26 22:43:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1350 transitions. [2018-10-26 22:43:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 22:43:37,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:43:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1100 states and 1355 transitions. [2018-10-26 22:43:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1355 transitions. [2018-10-26 22:43:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-26 22:43:38,022 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:43:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1129 states and 1403 transitions. [2018-10-26 22:43:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1403 transitions. [2018-10-26 22:43:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 22:43:40,425 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-26 22:43:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1153 states and 1431 transitions. [2018-10-26 22:43:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1431 transitions. [2018-10-26 22:43:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 22:43:41,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:43:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1154 states and 1432 transitions. [2018-10-26 22:43:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1432 transitions. [2018-10-26 22:43:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 22:43:42,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 106 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 22:43:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1173 states and 1458 transitions. [2018-10-26 22:43:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1458 transitions. [2018-10-26 22:43:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 22:43:43,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-26 22:43:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1179 states and 1466 transitions. [2018-10-26 22:43:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1466 transitions. [2018-10-26 22:43:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 22:43:43,793 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:46,413 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-26 22:43:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1202 states and 1493 transitions. [2018-10-26 22:43:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1493 transitions. [2018-10-26 22:43:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 22:43:47,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1205 states and 1497 transitions. [2018-10-26 22:43:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1497 transitions. [2018-10-26 22:43:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 22:43:48,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:43:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1219 states and 1510 transitions. [2018-10-26 22:43:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1510 transitions. [2018-10-26 22:43:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 22:43:49,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 22:43:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1237 states and 1534 transitions. [2018-10-26 22:43:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1534 transitions. [2018-10-26 22:43:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 22:43:52,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-26 22:43:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1305 states and 1604 transitions. [2018-10-26 22:43:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1604 transitions. [2018-10-26 22:43:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 22:43:53,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:43:54,381 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-26 22:43:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1379 states and 1686 transitions. [2018-10-26 22:43:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1686 transitions. [2018-10-26 22:43:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 22:43:56,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:43:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1380 states and 1686 transitions. [2018-10-26 22:43:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1686 transitions. [2018-10-26 22:43:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 22:43:56,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 22:43:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:43:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1394 states and 1703 transitions. [2018-10-26 22:43:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1703 transitions. [2018-10-26 22:43:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 22:43:57,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:43:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:43:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:44:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1439 states and 1750 transitions. [2018-10-26 22:44:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1750 transitions. [2018-10-26 22:44:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 22:44:02,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:44:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1442 states and 1754 transitions. [2018-10-26 22:44:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1754 transitions. [2018-10-26 22:44:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 22:44:03,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 22:44:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1459 states and 1775 transitions. [2018-10-26 22:44:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1775 transitions. [2018-10-26 22:44:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 22:44:04,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:06,325 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2018-10-26 22:44:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1489 states and 1817 transitions. [2018-10-26 22:44:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1817 transitions. [2018-10-26 22:44:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 22:44:08,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1502 states and 1832 transitions. [2018-10-26 22:44:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1832 transitions. [2018-10-26 22:44:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 22:44:10,065 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1507 states and 1837 transitions. [2018-10-26 22:44:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1837 transitions. [2018-10-26 22:44:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 22:44:10,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-26 22:44:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1578 states and 1911 transitions. [2018-10-26 22:44:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1911 transitions. [2018-10-26 22:44:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 22:44:11,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1593 states and 1935 transitions. [2018-10-26 22:44:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1935 transitions. [2018-10-26 22:44:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 22:44:16,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1596 states and 1939 transitions. [2018-10-26 22:44:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1939 transitions. [2018-10-26 22:44:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 22:44:17,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1598 states and 1943 transitions. [2018-10-26 22:44:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1943 transitions. [2018-10-26 22:44:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 22:44:17,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1600 states and 1946 transitions. [2018-10-26 22:44:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1946 transitions. [2018-10-26 22:44:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 22:44:18,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1609 states and 1956 transitions. [2018-10-26 22:44:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1956 transitions. [2018-10-26 22:44:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-26 22:44:18,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1614 states and 1960 transitions. [2018-10-26 22:44:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1960 transitions. [2018-10-26 22:44:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 22:44:19,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1632 states and 1990 transitions. [2018-10-26 22:44:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1990 transitions. [2018-10-26 22:44:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 22:44:22,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 1642 states and 2006 transitions. [2018-10-26 22:44:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2006 transitions. [2018-10-26 22:44:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 22:44:24,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1653 states and 2017 transitions. [2018-10-26 22:44:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2017 transitions. [2018-10-26 22:44:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 22:44:26,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 1658 states and 2022 transitions. [2018-10-26 22:44:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2022 transitions. [2018-10-26 22:44:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 22:44:27,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1667 states and 2030 transitions. [2018-10-26 22:44:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2030 transitions. [2018-10-26 22:44:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 22:44:27,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 22:44:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 1671 states and 2034 transitions. [2018-10-26 22:44:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2034 transitions. [2018-10-26 22:44:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-26 22:44:28,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 283 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 1691 states and 2059 transitions. [2018-10-26 22:44:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2059 transitions. [2018-10-26 22:44:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-26 22:44:31,773 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 283 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 1702 states and 2071 transitions. [2018-10-26 22:44:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2071 transitions. [2018-10-26 22:44:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-26 22:44:33,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 283 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 1707 states and 2075 transitions. [2018-10-26 22:44:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2075 transitions. [2018-10-26 22:44:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 22:44:33,993 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 258 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1712 states and 2081 transitions. [2018-10-26 22:44:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2081 transitions. [2018-10-26 22:44:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 22:44:35,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-26 22:44:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1721 states and 2089 transitions. [2018-10-26 22:44:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2089 transitions. [2018-10-26 22:44:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-26 22:44:35,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 22:44:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 1737 states and 2106 transitions. [2018-10-26 22:44:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2106 transitions. [2018-10-26 22:44:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-26 22:44:37,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 22:44:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 1739 states and 2107 transitions. [2018-10-26 22:44:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2107 transitions. [2018-10-26 22:44:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-26 22:44:37,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 22:44:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 1744 states and 2111 transitions. [2018-10-26 22:44:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2111 transitions. [2018-10-26 22:44:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-26 22:44:38,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 22:44:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1746 states and 2112 transitions. [2018-10-26 22:44:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2112 transitions. [2018-10-26 22:44:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-26 22:44:39,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 22:44:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 1748 states and 2113 transitions. [2018-10-26 22:44:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2113 transitions. [2018-10-26 22:44:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 22:44:39,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1787 states and 2155 transitions. [2018-10-26 22:44:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2155 transitions. [2018-10-26 22:44:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 22:44:42,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 1787 states and 2154 transitions. [2018-10-26 22:44:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2154 transitions. [2018-10-26 22:44:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-26 22:44:43,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 403 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:44:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1806 states and 2177 transitions. [2018-10-26 22:44:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2177 transitions. [2018-10-26 22:44:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-26 22:44:48,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:44:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 22:44:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:44:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1820 states and 2195 transitions. [2018-10-26 22:44:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2195 transitions. [2018-10-26 22:44:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-26 22:44:48,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:44:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:44:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:44:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:44:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:44:49,072 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 116 iterations. [2018-10-26 22:44:49,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 10:44:49 ImpRootNode [2018-10-26 22:44:49,246 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 22:44:49,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:44:49,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:44:49,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:44:49,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:42:33" (3/4) ... [2018-10-26 22:44:49,249 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:44:49,438 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b40c6205-dc1d-4db0-845b-f32fc47fd1ba/bin-2019/ukojak/witness.graphml [2018-10-26 22:44:49,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:44:49,439 INFO L168 Benchmark]: Toolchain (without parser) took 140418.30 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 955.8 MB in the beginning and 1.8 GB in the end (delta: -868.4 MB). Peak memory consumption was 965.6 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:49,439 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:44:49,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.42 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 926.3 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:49,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.23 ms. Allocated memory is still 1.0 GB. Free memory was 926.3 MB in the beginning and 918.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:49,440 INFO L168 Benchmark]: Boogie Preprocessor took 127.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 918.2 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:49,440 INFO L168 Benchmark]: RCFGBuilder took 3921.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 920.2 MB in the end (delta: 236.3 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:49,440 INFO L168 Benchmark]: CodeCheck took 135663.77 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 920.2 MB in the beginning and 1.9 GB in the end (delta: -940.2 MB). Peak memory consumption was 728.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:49,440 INFO L168 Benchmark]: Witness Printer took 191.39 ms. Allocated memory is still 2.9 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:44:49,445 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, 199 locations, 1 error locations. UNSAFE Result, 135.4s OverallTime, 116 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -668907512 SDtfs, -1741625568 SDslu, -2121674680 SDs, 0 SdLazy, 1920457480 SolverSat, 1302403368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 557.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115935 GetRequests, 110715 SyntacticMatches, 4026 SemanticMatches, 1194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965263 ImplicationChecksByTransitivity, 116.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 17999 NumberOfCodeBlocks, 17999 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 17642 ConstructedInterpolants, 0 QuantifiedInterpolants, 15442600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 115 InterpolantComputations, 91 PerfectInterpolantSequences, 15373/15770 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: 404]: 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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L224] a21 = 1 [L225] a8 = 14 [L226] a16 = 4 [L227] a20 = 0 [L228] a7 = 0 [L229] a17 = 0 [L230] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [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)) [L591] CALL calculate_output(input) [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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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=0, a8=14, 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L403] COND TRUE ((((((!(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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 450.42 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 926.3 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.23 ms. Allocated memory is still 1.0 GB. Free memory was 926.3 MB in the beginning and 918.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 918.2 MB in the beginning and 1.2 GB in the end (delta: -238.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3921.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 920.2 MB in the end (delta: 236.3 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. * CodeCheck took 135663.77 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 920.2 MB in the beginning and 1.9 GB in the end (delta: -940.2 MB). Peak memory consumption was 728.1 MB. Max. memory is 11.5 GB. * Witness Printer took 191.39 ms. Allocated memory is still 2.9 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...