./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/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 dd54b1bc34218a081600cff9517fd9b1806e0ce2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 11:05:29,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:05:29,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:05:29,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:05:29,548 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:05:29,548 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:05:29,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:05:29,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:05:29,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:05:29,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:05:29,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:05:29,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:05:29,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:05:29,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:05:29,555 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:05:29,556 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:05:29,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:05:29,558 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:05:29,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:05:29,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:05:29,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:05:29,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:05:29,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:05:29,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:05:29,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:05:29,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:05:29,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:05:29,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:05:29,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:05:29,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:05:29,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:05:29,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:05:29,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:05:29,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:05:29,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:05:29,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:05:29,571 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 11:05:29,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:05:29,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:05:29,582 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:05:29,582 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:05:29,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:05:29,582 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:05:29,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:05:29,583 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:05:29,583 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:05:29,583 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:05:29,583 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:05:29,583 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:05:29,584 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:05:29,584 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:05:29,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:05:29,584 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:05:29,584 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:05:29,584 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:05:29,585 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 11:05:29,585 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 11:05:29,585 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:05:29,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:05:29,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 11:05:29,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:05:29,586 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:05:29,586 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:05:29,586 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 11:05:29,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:05:29,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:05:29,586 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_8c711609-7e3c-490b-ad4f-489e9812dd6b/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 -> dd54b1bc34218a081600cff9517fd9b1806e0ce2 [2018-11-18 11:05:29,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:05:29,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:05:29,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:05:29,625 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:05:29,625 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:05:29,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c [2018-11-18 11:05:29,669 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/data/88be47657/27462150f2c246629f291cb2afa71946/FLAG4502dab8c [2018-11-18 11:05:30,119 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:05:30,119 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/sv-benchmarks/c/eca-rers2012/Problem01_label21_false-unreach-call_false-termination.c [2018-11-18 11:05:30,128 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/data/88be47657/27462150f2c246629f291cb2afa71946/FLAG4502dab8c [2018-11-18 11:05:30,144 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/data/88be47657/27462150f2c246629f291cb2afa71946 [2018-11-18 11:05:30,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:05:30,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:05:30,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:05:30,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:05:30,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:05:30,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a388c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30, skipping insertion in model container [2018-11-18 11:05:30,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:05:30,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:05:30,442 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:05:30,446 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:05:30,511 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:05:30,523 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:05:30,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30 WrapperNode [2018-11-18 11:05:30,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:05:30,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:05:30,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:05:30,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:05:30,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:05:30,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:05:30,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:05:30,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:05:30,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... [2018-11-18 11:05:30,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:05:30,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:05:30,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:05:30,672 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:05:30,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/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-11-18 11:05:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 11:05:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:05:30,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:05:31,964 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:05:31,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:05:31 BoogieIcfgContainer [2018-11-18 11:05:31,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:05:31,965 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 11:05:31,965 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 11:05:31,972 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 11:05:31,972 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:05:31" (1/1) ... [2018-11-18 11:05:31,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:05:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-18 11:05:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-18 11:05:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 11:05:32,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-11-18 11:05:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-11-18 11:05:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 11:05:32,639 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 152 states and 229 transitions. [2018-11-18 11:05:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2018-11-18 11:05:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 11:05:32,829 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 158 states and 240 transitions. [2018-11-18 11:05:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2018-11-18 11:05:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 11:05:32,989 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 229 states and 320 transitions. [2018-11-18 11:05:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 320 transitions. [2018-11-18 11:05:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 11:05:33,402 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 240 states and 337 transitions. [2018-11-18 11:05:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 337 transitions. [2018-11-18 11:05:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 11:05:33,827 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 252 states and 356 transitions. [2018-11-18 11:05:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 356 transitions. [2018-11-18 11:05:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 11:05:34,294 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 258 states and 363 transitions. [2018-11-18 11:05:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 363 transitions. [2018-11-18 11:05:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 11:05:34,513 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 262 states and 367 transitions. [2018-11-18 11:05:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2018-11-18 11:05:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 11:05:34,635 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 11:05:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 274 states and 382 transitions. [2018-11-18 11:05:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 382 transitions. [2018-11-18 11:05:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 11:05:34,878 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 276 states and 385 transitions. [2018-11-18 11:05:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 385 transitions. [2018-11-18 11:05:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 11:05:35,056 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 282 states and 393 transitions. [2018-11-18 11:05:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 393 transitions. [2018-11-18 11:05:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 11:05:35,353 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 286 states and 399 transitions. [2018-11-18 11:05:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 399 transitions. [2018-11-18 11:05:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 11:05:35,487 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 11:05:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 294 states and 408 transitions. [2018-11-18 11:05:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 408 transitions. [2018-11-18 11:05:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 11:05:35,699 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 299 states and 413 transitions. [2018-11-18 11:05:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 413 transitions. [2018-11-18 11:05:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 11:05:36,146 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 11:05:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 311 states and 429 transitions. [2018-11-18 11:05:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 429 transitions. [2018-11-18 11:05:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 11:05:36,674 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 11:05:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 315 states and 433 transitions. [2018-11-18 11:05:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2018-11-18 11:05:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 11:05:36,835 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 330 states and 450 transitions. [2018-11-18 11:05:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 450 transitions. [2018-11-18 11:05:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 11:05:37,039 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 336 states and 461 transitions. [2018-11-18 11:05:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 461 transitions. [2018-11-18 11:05:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 11:05:37,614 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 337 states and 461 transitions. [2018-11-18 11:05:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 461 transitions. [2018-11-18 11:05:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 11:05:37,780 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:05:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 354 states and 479 transitions. [2018-11-18 11:05:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 479 transitions. [2018-11-18 11:05:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 11:05:38,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 385 states and 515 transitions. [2018-11-18 11:05:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 515 transitions. [2018-11-18 11:05:38,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 11:05:38,674 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 399 states and 530 transitions. [2018-11-18 11:05:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 530 transitions. [2018-11-18 11:05:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 11:05:38,951 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 402 states and 534 transitions. [2018-11-18 11:05:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 534 transitions. [2018-11-18 11:05:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 11:05:39,136 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 416 states and 549 transitions. [2018-11-18 11:05:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 549 transitions. [2018-11-18 11:05:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 11:05:39,804 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:05:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 428 states and 572 transitions. [2018-11-18 11:05:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 572 transitions. [2018-11-18 11:05:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 11:05:40,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:05:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 432 states and 577 transitions. [2018-11-18 11:05:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 577 transitions. [2018-11-18 11:05:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 11:05:40,776 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:05:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 438 states and 586 transitions. [2018-11-18 11:05:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 586 transitions. [2018-11-18 11:05:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 11:05:41,188 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 448 states and 604 transitions. [2018-11-18 11:05:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 604 transitions. [2018-11-18 11:05:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 11:05:42,629 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 452 states and 610 transitions. [2018-11-18 11:05:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 610 transitions. [2018-11-18 11:05:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 11:05:43,228 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 466 states and 626 transitions. [2018-11-18 11:05:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 626 transitions. [2018-11-18 11:05:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 11:05:43,627 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 11:05:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 477 states and 638 transitions. [2018-11-18 11:05:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 638 transitions. [2018-11-18 11:05:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 11:05:43,683 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 522 states and 695 transitions. [2018-11-18 11:05:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2018-11-18 11:05:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 11:05:45,376 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 527 states and 700 transitions. [2018-11-18 11:05:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 700 transitions. [2018-11-18 11:05:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 11:05:45,782 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 549 states and 726 transitions. [2018-11-18 11:05:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 726 transitions. [2018-11-18 11:05:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 11:05:45,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 11:05:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 551 states and 729 transitions. [2018-11-18 11:05:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 729 transitions. [2018-11-18 11:05:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 11:05:46,259 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 11:05:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 558 states and 736 transitions. [2018-11-18 11:05:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 736 transitions. [2018-11-18 11:05:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 11:05:46,338 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 589 states and 775 transitions. [2018-11-18 11:05:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 775 transitions. [2018-11-18 11:05:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 11:05:47,877 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 597 states and 787 transitions. [2018-11-18 11:05:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 787 transitions. [2018-11-18 11:05:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 11:05:48,487 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 601 states and 791 transitions. [2018-11-18 11:05:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 791 transitions. [2018-11-18 11:05:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 11:05:48,811 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 666 states and 858 transitions. [2018-11-18 11:05:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 858 transitions. [2018-11-18 11:05:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 11:05:50,698 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 11:05:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 680 states and 871 transitions. [2018-11-18 11:05:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 871 transitions. [2018-11-18 11:05:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 11:05:50,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 11:05:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 681 states and 871 transitions. [2018-11-18 11:05:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 871 transitions. [2018-11-18 11:05:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 11:05:50,831 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 720 states and 924 transitions. [2018-11-18 11:05:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 924 transitions. [2018-11-18 11:05:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 11:05:52,891 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 755 states and 959 transitions. [2018-11-18 11:05:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 959 transitions. [2018-11-18 11:05:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 11:05:53,599 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 794 states and 998 transitions. [2018-11-18 11:05:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 998 transitions. [2018-11-18 11:05:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 11:05:53,760 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 11:05:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 800 states and 1004 transitions. [2018-11-18 11:05:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1004 transitions. [2018-11-18 11:05:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 11:05:53,964 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 11:05:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 809 states and 1016 transitions. [2018-11-18 11:05:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1016 transitions. [2018-11-18 11:05:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 11:05:54,699 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 11:05:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 813 states and 1021 transitions. [2018-11-18 11:05:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1021 transitions. [2018-11-18 11:05:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 11:05:54,945 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:05:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 844 states and 1065 transitions. [2018-11-18 11:05:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1065 transitions. [2018-11-18 11:05:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 11:05:57,230 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:05:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 848 states and 1069 transitions. [2018-11-18 11:05:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1069 transitions. [2018-11-18 11:05:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 11:05:57,538 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:05:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 855 states and 1078 transitions. [2018-11-18 11:05:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1078 transitions. [2018-11-18 11:05:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 11:05:58,093 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 874 states and 1101 transitions. [2018-11-18 11:05:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1101 transitions. [2018-11-18 11:05:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 11:05:58,962 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:05:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:05:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 876 states and 1103 transitions. [2018-11-18 11:05:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1103 transitions. [2018-11-18 11:05:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 11:05:59,218 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:05:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:06:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 890 states and 1125 transitions. [2018-11-18 11:06:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1125 transitions. [2018-11-18 11:06:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 11:06:00,236 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:06:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 896 states and 1132 transitions. [2018-11-18 11:06:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1132 transitions. [2018-11-18 11:06:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 11:06:00,856 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:06:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 902 states and 1140 transitions. [2018-11-18 11:06:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1140 transitions. [2018-11-18 11:06:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 11:06:01,395 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 11:06:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 967 states and 1206 transitions. [2018-11-18 11:06:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1206 transitions. [2018-11-18 11:06:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-18 11:06:01,854 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 101 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 11:06:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1037 states and 1283 transitions. [2018-11-18 11:06:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1283 transitions. [2018-11-18 11:06:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 11:06:03,371 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 11:06:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1040 states and 1286 transitions. [2018-11-18 11:06:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1286 transitions. [2018-11-18 11:06:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 11:06:03,868 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1084 states and 1340 transitions. [2018-11-18 11:06:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1340 transitions. [2018-11-18 11:06:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 11:06:07,346 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1088 states and 1345 transitions. [2018-11-18 11:06:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1345 transitions. [2018-11-18 11:06:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 11:06:07,732 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 183 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 11:06:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1093 states and 1354 transitions. [2018-11-18 11:06:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1354 transitions. [2018-11-18 11:06:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 11:06:08,454 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 183 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 11:06:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1097 states and 1358 transitions. [2018-11-18 11:06:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1358 transitions. [2018-11-18 11:06:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 11:06:08,775 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 11:06:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1107 states and 1369 transitions. [2018-11-18 11:06:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1369 transitions. [2018-11-18 11:06:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 11:06:09,027 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1125 states and 1399 transitions. [2018-11-18 11:06:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1399 transitions. [2018-11-18 11:06:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 11:06:11,839 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1134 states and 1410 transitions. [2018-11-18 11:06:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1410 transitions. [2018-11-18 11:06:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 11:06:13,241 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 11:06:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1136 states and 1411 transitions. [2018-11-18 11:06:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1411 transitions. [2018-11-18 11:06:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 11:06:13,550 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1137 states and 1411 transitions. [2018-11-18 11:06:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1411 transitions. [2018-11-18 11:06:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 11:06:13,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1165 states and 1446 transitions. [2018-11-18 11:06:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1446 transitions. [2018-11-18 11:06:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 11:06:16,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1173 states and 1455 transitions. [2018-11-18 11:06:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1455 transitions. [2018-11-18 11:06:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 11:06:17,273 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 11:06:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1175 states and 1457 transitions. [2018-11-18 11:06:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1457 transitions. [2018-11-18 11:06:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 11:06:17,529 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 11:06:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1207 states and 1496 transitions. [2018-11-18 11:06:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1496 transitions. [2018-11-18 11:06:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 11:06:19,763 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1261 states and 1561 transitions. [2018-11-18 11:06:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1561 transitions. [2018-11-18 11:06:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 11:06:24,255 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1263 states and 1562 transitions. [2018-11-18 11:06:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1562 transitions. [2018-11-18 11:06:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 11:06:24,768 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 11:06:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1265 states and 1563 transitions. [2018-11-18 11:06:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1563 transitions. [2018-11-18 11:06:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 11:06:25,416 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 11:06:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1272 states and 1571 transitions. [2018-11-18 11:06:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1571 transitions. [2018-11-18 11:06:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 11:06:25,774 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 11:06:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1277 states and 1576 transitions. [2018-11-18 11:06:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1576 transitions. [2018-11-18 11:06:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-18 11:06:26,125 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:06:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1324 states and 1629 transitions. [2018-11-18 11:06:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1629 transitions. [2018-11-18 11:06:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-18 11:06:28,786 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:06:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1326 states and 1630 transitions. [2018-11-18 11:06:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1630 transitions. [2018-11-18 11:06:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-18 11:06:29,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 192 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:06:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1354 states and 1669 transitions. [2018-11-18 11:06:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1669 transitions. [2018-11-18 11:06:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-18 11:06:30,740 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 192 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:06:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1362 states and 1681 transitions. [2018-11-18 11:06:31,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1681 transitions. [2018-11-18 11:06:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 11:06:31,395 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1394 states and 1714 transitions. [2018-11-18 11:06:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1714 transitions. [2018-11-18 11:06:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 11:06:33,887 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1395 states and 1714 transitions. [2018-11-18 11:06:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1714 transitions. [2018-11-18 11:06:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 11:06:34,546 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:06:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1443 states and 1764 transitions. [2018-11-18 11:06:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1764 transitions. [2018-11-18 11:06:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 11:06:38,104 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:06:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1443 states and 1763 transitions. [2018-11-18 11:06:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1763 transitions. [2018-11-18 11:06:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 11:06:38,745 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1449 states and 1772 transitions. [2018-11-18 11:06:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1772 transitions. [2018-11-18 11:06:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 11:06:40,973 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1453 states and 1776 transitions. [2018-11-18 11:06:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1776 transitions. [2018-11-18 11:06:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-18 11:06:41,525 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 11:06:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1524 states and 1850 transitions. [2018-11-18 11:06:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1850 transitions. [2018-11-18 11:06:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 11:06:42,763 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1528 states and 1856 transitions. [2018-11-18 11:06:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1856 transitions. [2018-11-18 11:06:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 11:06:44,598 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1543 states and 1876 transitions. [2018-11-18 11:06:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1876 transitions. [2018-11-18 11:06:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 11:06:45,901 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1547 states and 1880 transitions. [2018-11-18 11:06:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1880 transitions. [2018-11-18 11:06:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 11:06:46,431 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 144 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1601 states and 1945 transitions. [2018-11-18 11:06:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1945 transitions. [2018-11-18 11:06:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 11:06:50,490 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 144 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1637 states and 1980 transitions. [2018-11-18 11:06:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 1980 transitions. [2018-11-18 11:06:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 11:06:52,746 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-18 11:06:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1708 states and 2054 transitions. [2018-11-18 11:06:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2054 transitions. [2018-11-18 11:06:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 11:06:53,505 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 177 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 1751 states and 2100 transitions. [2018-11-18 11:06:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2100 transitions. [2018-11-18 11:06:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 11:06:57,963 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 177 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:06:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 1767 states and 2118 transitions. [2018-11-18 11:06:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2118 transitions. [2018-11-18 11:06:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 11:06:59,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:06:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 11:07:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 1800 states and 2157 transitions. [2018-11-18 11:07:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2157 transitions. [2018-11-18 11:07:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 11:07:04,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 11:07:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1822 states and 2177 transitions. [2018-11-18 11:07:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2177 transitions. [2018-11-18 11:07:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-18 11:07:07,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 179 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 11:07:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 1827 states and 2182 transitions. [2018-11-18 11:07:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2182 transitions. [2018-11-18 11:07:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 11:07:08,076 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 11:07:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1875 states and 2233 transitions. [2018-11-18 11:07:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2233 transitions. [2018-11-18 11:07:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 11:07:13,427 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 11:07:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1889 states and 2245 transitions. [2018-11-18 11:07:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2245 transitions. [2018-11-18 11:07:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-18 11:07:14,881 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 191 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 1891 states and 2247 transitions. [2018-11-18 11:07:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2247 transitions. [2018-11-18 11:07:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-18 11:07:16,473 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 191 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:17,399 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-18 11:07:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1922 states and 2279 transitions. [2018-11-18 11:07:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2279 transitions. [2018-11-18 11:07:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-18 11:07:19,508 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 191 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 1944 states and 2301 transitions. [2018-11-18 11:07:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2301 transitions. [2018-11-18 11:07:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-18 11:07:20,744 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-18 11:07:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2014 states and 2373 transitions. [2018-11-18 11:07:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2373 transitions. [2018-11-18 11:07:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 11:07:21,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 204 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 11:07:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2016 states and 2375 transitions. [2018-11-18 11:07:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2375 transitions. [2018-11-18 11:07:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-18 11:07:21,998 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 11:07:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2018 states and 2377 transitions. [2018-11-18 11:07:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2377 transitions. [2018-11-18 11:07:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:22,619 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2086 states and 2467 transitions. [2018-11-18 11:07:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2467 transitions. [2018-11-18 11:07:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:28,716 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2138 states and 2532 transitions. [2018-11-18 11:07:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2532 transitions. [2018-11-18 11:07:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:33,194 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2155 states and 2558 transitions. [2018-11-18 11:07:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2558 transitions. [2018-11-18 11:07:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:34,824 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2173 states and 2576 transitions. [2018-11-18 11:07:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2576 transitions. [2018-11-18 11:07:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:35,796 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2196 states and 2603 transitions. [2018-11-18 11:07:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2603 transitions. [2018-11-18 11:07:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:37,621 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2212 states and 2619 transitions. [2018-11-18 11:07:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2619 transitions. [2018-11-18 11:07:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:38,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2214 states and 2621 transitions. [2018-11-18 11:07:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2621 transitions. [2018-11-18 11:07:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:39,049 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2230 states and 2637 transitions. [2018-11-18 11:07:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2637 transitions. [2018-11-18 11:07:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:39,713 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2260 states and 2676 transitions. [2018-11-18 11:07:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2676 transitions. [2018-11-18 11:07:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:41,962 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2281 states and 2699 transitions. [2018-11-18 11:07:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2699 transitions. [2018-11-18 11:07:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:43,206 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2288 states and 2707 transitions. [2018-11-18 11:07:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2707 transitions. [2018-11-18 11:07:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-18 11:07:43,865 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 11:07:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2295 states and 2720 transitions. [2018-11-18 11:07:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2720 transitions. [2018-11-18 11:07:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 11:07:44,878 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2322 states and 2751 transitions. [2018-11-18 11:07:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2751 transitions. [2018-11-18 11:07:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 11:07:49,702 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:07:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2337 states and 2773 transitions. [2018-11-18 11:07:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2773 transitions. [2018-11-18 11:07:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 11:07:54,577 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:07:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:08:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2361 states and 2802 transitions. [2018-11-18 11:08:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2802 transitions. [2018-11-18 11:08:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 11:08:00,248 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:08:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:08:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2363 states and 2804 transitions. [2018-11-18 11:08:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 2804 transitions. [2018-11-18 11:08:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 11:08:01,700 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:08:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 289 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:08:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2382 states and 2822 transitions. [2018-11-18 11:08:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2822 transitions. [2018-11-18 11:08:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-18 11:08:03,804 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:08:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 346 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 11:08:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:08:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2393 states and 2834 transitions. [2018-11-18 11:08:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2834 transitions. [2018-11-18 11:08:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-18 11:08:06,487 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:08:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 346 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 11:08:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:08:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2397 states and 2838 transitions. [2018-11-18 11:08:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2838 transitions. [2018-11-18 11:08:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 11:08:07,421 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:08:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 308 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 11:08:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:08:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2437 states and 2881 transitions. [2018-11-18 11:08:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2881 transitions. [2018-11-18 11:08:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 11:08:12,654 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:08:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:12,886 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 128 iterations. [2018-11-18 11:08:13,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 11:08:13 ImpRootNode [2018-11-18 11:08:13,037 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 11:08:13,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:08:13,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:08:13,038 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:08:13,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:05:31" (3/4) ... [2018-11-18 11:08:13,042 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 11:08:13,141 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8c711609-7e3c-490b-ad4f-489e9812dd6b/bin-2019/ukojak/witness.graphml [2018-11-18 11:08:13,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:08:13,141 INFO L168 Benchmark]: Toolchain (without parser) took 162994.86 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 953.8 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 799.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:13,142 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:08:13,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 918.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:13,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -223.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:13,142 INFO L168 Benchmark]: Boogie Preprocessor took 43.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:08:13,142 INFO L168 Benchmark]: RCFGBuilder took 1292.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.2 MB in the end (delta: 229.4 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:13,143 INFO L168 Benchmark]: CodeCheck took 161073.00 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 913.2 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 603.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:13,143 INFO L168 Benchmark]: Witness Printer took 102.69 ms. Allocated memory is still 3.8 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:08:13,144 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, 160.8s OverallTime, 128 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1053548536 SDtfs, 694592014 SDslu, -909300248 SDs, 0 SdLazy, 1521192620 SolverSat, -703852606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 346.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145777 GetRequests, 138636 SyntacticMatches, 5665 SemanticMatches, 1476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520835 ImplicationChecksByTransitivity, 142.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 22074 NumberOfCodeBlocks, 22074 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 21687 ConstructedInterpolants, 0 QuantifiedInterpolants, 30927808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 127 InterpolantComputations, 81 PerfectInterpolantSequences, 19960/20917 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: 425]: 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 FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=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] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=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] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=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] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=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] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=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] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=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] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=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] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=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] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=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] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=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] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=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] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=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] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=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] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=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] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=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] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=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] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=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] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=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] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=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] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=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] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=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] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=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] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=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] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=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] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=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] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=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] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=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] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=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] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=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] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=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] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=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] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=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] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=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] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=6, a17=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] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=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] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=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] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=6, a17=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] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=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] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=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] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND TRUE ((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))) [L383] a20 = 0 [L384] a21 = 1 [L385] a8 = 14 [L386] a17 = 0 [L387] a16 = 5 [L388] a7 = 1 [L389] RET return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((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))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 918.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -223.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1292.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.2 MB in the end (delta: 229.4 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. * CodeCheck took 161073.00 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 913.2 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 603.9 MB. Max. memory is 11.5 GB. * Witness Printer took 102.69 ms. Allocated memory is still 3.8 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...