./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/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 00372dd9706fe72201713f336fbc903974e88ef8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:03:59,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:03:59,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:04:00,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:04:00,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:04:00,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:04:00,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:04:00,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:04:00,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:04:00,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:04:00,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:04:00,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:04:00,006 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:04:00,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:04:00,008 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:04:00,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:04:00,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:04:00,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:04:00,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:04:00,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:04:00,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:04:00,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:04:00,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:04:00,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:04:00,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:04:00,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:04:00,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:04:00,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:04:00,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:04:00,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:04:00,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:04:00,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:04:00,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:04:00,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:04:00,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:04:00,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:04:00,018 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 08:04:00,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:04:00,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:04:00,025 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:04:00,025 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 08:04:00,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:04:00,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:04:00,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:04:00,027 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:04:00,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:04:00,027 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 08:04:00,027 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 08:04:00,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:04:00,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:04:00,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 08:04:00,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:04:00,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:04:00,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:04:00,028 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 08:04:00,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:04:00,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:04:00,028 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_09522bd9-5b9c-4555-9a45-d77a53ccc41c/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 -> 00372dd9706fe72201713f336fbc903974e88ef8 [2018-12-09 08:04:00,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:04:00,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:04:00,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:04:00,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:04:00,058 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:04:00,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c [2018-12-09 08:04:00,099 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/data/a77f82bf5/2fcb66f7dcb8475f9fc2f633fbe4e825/FLAG1108a0f97 [2018-12-09 08:04:00,561 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:04:00,561 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/sv-benchmarks/c/eca-rers2012/Problem01_label57_false-unreach-call_false-termination.c [2018-12-09 08:04:00,568 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/data/a77f82bf5/2fcb66f7dcb8475f9fc2f633fbe4e825/FLAG1108a0f97 [2018-12-09 08:04:00,576 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/data/a77f82bf5/2fcb66f7dcb8475f9fc2f633fbe4e825 [2018-12-09 08:04:00,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:04:00,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:04:00,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:04:00,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:04:00,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:04:00,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:00,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00, skipping insertion in model container [2018-12-09 08:04:00,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:00,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:04:00,616 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:04:00,803 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:04:00,807 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:04:00,913 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:04:00,924 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:04:00,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00 WrapperNode [2018-12-09 08:04:00,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:04:00,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:04:00,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:04:00,925 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:04:00,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:00,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:00,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:04:00,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:04:00,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:04:00,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:04:00,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:00,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:00,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:00,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:01,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:01,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:01,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... [2018-12-09 08:04:01,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:04:01,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:04:01,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:04:01,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:04:01,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:04:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 08:04:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:04:01,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:04:02,021 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:04:02,022 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 08:04:02,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:04:02 BoogieIcfgContainer [2018-12-09 08:04:02,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:04:02,023 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 08:04:02,023 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 08:04:02,033 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 08:04:02,033 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:04:02" (1/1) ... [2018-12-09 08:04:02,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:04:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-09 08:04:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-09 08:04:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 08:04:02,071 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2018-12-09 08:04:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2018-12-09 08:04:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 08:04:02,559 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2018-12-09 08:04:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2018-12-09 08:04:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 08:04:02,737 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 150 states and 245 transitions. [2018-12-09 08:04:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 245 transitions. [2018-12-09 08:04:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 08:04:02,835 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 151 states and 246 transitions. [2018-12-09 08:04:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 246 transitions. [2018-12-09 08:04:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 08:04:02,939 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 159 states and 261 transitions. [2018-12-09 08:04:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 261 transitions. [2018-12-09 08:04:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 08:04:03,135 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 08:04:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 170 states and 280 transitions. [2018-12-09 08:04:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 280 transitions. [2018-12-09 08:04:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 08:04:03,509 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 171 states and 281 transitions. [2018-12-09 08:04:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 281 transitions. [2018-12-09 08:04:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 08:04:03,564 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 177 states and 288 transitions. [2018-12-09 08:04:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 288 transitions. [2018-12-09 08:04:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 08:04:03,687 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 191 states and 307 transitions. [2018-12-09 08:04:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 307 transitions. [2018-12-09 08:04:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 08:04:04,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 200 states and 325 transitions. [2018-12-09 08:04:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 325 transitions. [2018-12-09 08:04:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 08:04:04,428 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 201 states and 327 transitions. [2018-12-09 08:04:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 327 transitions. [2018-12-09 08:04:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 08:04:04,524 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 202 states and 329 transitions. [2018-12-09 08:04:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 329 transitions. [2018-12-09 08:04:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 08:04:04,545 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 203 states and 330 transitions. [2018-12-09 08:04:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 330 transitions. [2018-12-09 08:04:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 08:04:04,586 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 214 states and 347 transitions. [2018-12-09 08:04:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 347 transitions. [2018-12-09 08:04:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 08:04:05,111 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 217 states and 350 transitions. [2018-12-09 08:04:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 350 transitions. [2018-12-09 08:04:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 08:04:05,137 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 219 states and 351 transitions. [2018-12-09 08:04:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2018-12-09 08:04:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 08:04:05,216 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 223 states and 355 transitions. [2018-12-09 08:04:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 355 transitions. [2018-12-09 08:04:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 08:04:05,326 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 356 transitions. [2018-12-09 08:04:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 356 transitions. [2018-12-09 08:04:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 08:04:05,450 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 230 states and 366 transitions. [2018-12-09 08:04:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 366 transitions. [2018-12-09 08:04:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 08:04:05,660 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 240 states and 380 transitions. [2018-12-09 08:04:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 380 transitions. [2018-12-09 08:04:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 08:04:06,066 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 241 states and 381 transitions. [2018-12-09 08:04:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 381 transitions. [2018-12-09 08:04:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 08:04:06,234 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 243 states and 382 transitions. [2018-12-09 08:04:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2018-12-09 08:04:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 08:04:06,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 254 states and 392 transitions. [2018-12-09 08:04:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2018-12-09 08:04:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 08:04:06,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 278 states and 426 transitions. [2018-12-09 08:04:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 426 transitions. [2018-12-09 08:04:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 08:04:07,440 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 280 states and 431 transitions. [2018-12-09 08:04:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 431 transitions. [2018-12-09 08:04:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 08:04:07,557 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 283 states and 434 transitions. [2018-12-09 08:04:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2018-12-09 08:04:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:04:07,616 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 298 states and 451 transitions. [2018-12-09 08:04:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 451 transitions. [2018-12-09 08:04:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:04:07,975 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 301 states and 454 transitions. [2018-12-09 08:04:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 454 transitions. [2018-12-09 08:04:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:04:08,122 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 326 states and 489 transitions. [2018-12-09 08:04:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 489 transitions. [2018-12-09 08:04:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 08:04:09,073 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 337 states and 501 transitions. [2018-12-09 08:04:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2018-12-09 08:04:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 08:04:09,711 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 362 states and 544 transitions. [2018-12-09 08:04:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2018-12-09 08:04:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 08:04:12,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 378 states and 566 transitions. [2018-12-09 08:04:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 566 transitions. [2018-12-09 08:04:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 08:04:13,104 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 379 states and 568 transitions. [2018-12-09 08:04:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 568 transitions. [2018-12-09 08:04:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 08:04:13,414 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 384 states and 574 transitions. [2018-12-09 08:04:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 574 transitions. [2018-12-09 08:04:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 08:04:13,871 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 390 states and 580 transitions. [2018-12-09 08:04:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 580 transitions. [2018-12-09 08:04:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 08:04:14,129 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 391 states and 580 transitions. [2018-12-09 08:04:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 580 transitions. [2018-12-09 08:04:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 08:04:14,402 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 393 states and 583 transitions. [2018-12-09 08:04:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 583 transitions. [2018-12-09 08:04:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 08:04:14,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 407 states and 607 transitions. [2018-12-09 08:04:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2018-12-09 08:04:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 08:04:15,819 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 418 states and 618 transitions. [2018-12-09 08:04:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 618 transitions. [2018-12-09 08:04:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 08:04:16,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 429 states and 631 transitions. [2018-12-09 08:04:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 631 transitions. [2018-12-09 08:04:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 08:04:17,016 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 436 states and 641 transitions. [2018-12-09 08:04:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 641 transitions. [2018-12-09 08:04:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 08:04:17,544 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 438 states and 642 transitions. [2018-12-09 08:04:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 642 transitions. [2018-12-09 08:04:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 08:04:17,821 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 466 states and 674 transitions. [2018-12-09 08:04:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 674 transitions. [2018-12-09 08:04:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 08:04:19,219 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 490 states and 709 transitions. [2018-12-09 08:04:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 709 transitions. [2018-12-09 08:04:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 08:04:20,794 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 497 states and 716 transitions. [2018-12-09 08:04:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 716 transitions. [2018-12-09 08:04:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 08:04:20,944 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 501 states and 720 transitions. [2018-12-09 08:04:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 720 transitions. [2018-12-09 08:04:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 08:04:21,158 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 502 states and 720 transitions. [2018-12-09 08:04:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 720 transitions. [2018-12-09 08:04:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 08:04:21,314 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 503 states and 721 transitions. [2018-12-09 08:04:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 721 transitions. [2018-12-09 08:04:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 08:04:21,808 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 511 states and 728 transitions. [2018-12-09 08:04:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 728 transitions. [2018-12-09 08:04:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 08:04:22,248 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 581 states and 813 transitions. [2018-12-09 08:04:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 813 transitions. [2018-12-09 08:04:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 08:04:22,731 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 590 states and 826 transitions. [2018-12-09 08:04:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 826 transitions. [2018-12-09 08:04:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 08:04:23,369 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 602 states and 836 transitions. [2018-12-09 08:04:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 836 transitions. [2018-12-09 08:04:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 08:04:23,810 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 611 states and 848 transitions. [2018-12-09 08:04:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 848 transitions. [2018-12-09 08:04:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 08:04:23,857 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 624 states and 863 transitions. [2018-12-09 08:04:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 863 transitions. [2018-12-09 08:04:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 08:04:24,128 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 626 states and 864 transitions. [2018-12-09 08:04:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 864 transitions. [2018-12-09 08:04:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 08:04:24,246 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 630 states and 867 transitions. [2018-12-09 08:04:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 867 transitions. [2018-12-09 08:04:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 08:04:24,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 632 states and 868 transitions. [2018-12-09 08:04:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 868 transitions. [2018-12-09 08:04:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 08:04:24,494 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 646 states and 884 transitions. [2018-12-09 08:04:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 884 transitions. [2018-12-09 08:04:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 08:04:24,821 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 648 states and 887 transitions. [2018-12-09 08:04:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 887 transitions. [2018-12-09 08:04:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 08:04:24,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 693 states and 936 transitions. [2018-12-09 08:04:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 936 transitions. [2018-12-09 08:04:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 08:04:27,154 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 08:04:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 789 states and 1040 transitions. [2018-12-09 08:04:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1040 transitions. [2018-12-09 08:04:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 08:04:28,591 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 802 states and 1060 transitions. [2018-12-09 08:04:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1060 transitions. [2018-12-09 08:04:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 08:04:29,230 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 815 states and 1094 transitions. [2018-12-09 08:04:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1094 transitions. [2018-12-09 08:04:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 08:04:30,390 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 820 states and 1101 transitions. [2018-12-09 08:04:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1101 transitions. [2018-12-09 08:04:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 08:04:31,502 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:04:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 825 states and 1111 transitions. [2018-12-09 08:04:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1111 transitions. [2018-12-09 08:04:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 08:04:32,028 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 833 states and 1121 transitions. [2018-12-09 08:04:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1121 transitions. [2018-12-09 08:04:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 08:04:32,726 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 838 states and 1125 transitions. [2018-12-09 08:04:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1125 transitions. [2018-12-09 08:04:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 08:04:32,901 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 08:04:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 843 states and 1135 transitions. [2018-12-09 08:04:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1135 transitions. [2018-12-09 08:04:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:04:33,255 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 883 states and 1186 transitions. [2018-12-09 08:04:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1186 transitions. [2018-12-09 08:04:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:04:39,979 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 899 states and 1201 transitions. [2018-12-09 08:04:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1201 transitions. [2018-12-09 08:04:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:04:40,688 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:04:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 903 states and 1205 transitions. [2018-12-09 08:04:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1205 transitions. [2018-12-09 08:04:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 08:04:40,991 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 08:04:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 912 states and 1227 transitions. [2018-12-09 08:04:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1227 transitions. [2018-12-09 08:04:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 08:04:42,407 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 08:04:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 937 states and 1257 transitions. [2018-12-09 08:04:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1257 transitions. [2018-12-09 08:04:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-09 08:04:45,256 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 08:04:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 951 states and 1280 transitions. [2018-12-09 08:04:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1280 transitions. [2018-12-09 08:04:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-09 08:04:47,784 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 968 states and 1297 transitions. [2018-12-09 08:04:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1297 transitions. [2018-12-09 08:04:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-09 08:04:47,901 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 998 states and 1331 transitions. [2018-12-09 08:04:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1331 transitions. [2018-12-09 08:04:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 08:04:50,253 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:04:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1023 states and 1358 transitions. [2018-12-09 08:04:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1358 transitions. [2018-12-09 08:04:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 08:04:52,011 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:04:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:04:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:04:55,932 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-09 08:05:00,132 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-09 08:05:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1080 states and 1419 transitions. [2018-12-09 08:05:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1419 transitions. [2018-12-09 08:05:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 08:05:02,142 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:05:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1084 states and 1424 transitions. [2018-12-09 08:05:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1424 transitions. [2018-12-09 08:05:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 08:05:02,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1122 states and 1474 transitions. [2018-12-09 08:05:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1474 transitions. [2018-12-09 08:05:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 08:05:05,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1153 states and 1504 transitions. [2018-12-09 08:05:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1504 transitions. [2018-12-09 08:05:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 08:05:06,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:05:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1170 states and 1522 transitions. [2018-12-09 08:05:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1522 transitions. [2018-12-09 08:05:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 08:05:06,414 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-09 08:05:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1171 states and 1522 transitions. [2018-12-09 08:05:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1522 transitions. [2018-12-09 08:05:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 08:05:06,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1212 states and 1565 transitions. [2018-12-09 08:05:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1565 transitions. [2018-12-09 08:05:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 08:05:07,406 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1223 states and 1577 transitions. [2018-12-09 08:05:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1577 transitions. [2018-12-09 08:05:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 08:05:07,677 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 08:05:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1236 states and 1596 transitions. [2018-12-09 08:05:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1596 transitions. [2018-12-09 08:05:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 08:05:08,714 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:05:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1262 states and 1631 transitions. [2018-12-09 08:05:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1631 transitions. [2018-12-09 08:05:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 08:05:09,274 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1282 states and 1653 transitions. [2018-12-09 08:05:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1653 transitions. [2018-12-09 08:05:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 08:05:11,236 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 08:05:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1284 states and 1659 transitions. [2018-12-09 08:05:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1659 transitions. [2018-12-09 08:05:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 08:05:11,546 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 08:05:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1289 states and 1664 transitions. [2018-12-09 08:05:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1664 transitions. [2018-12-09 08:05:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 08:05:12,127 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 08:05:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1293 states and 1668 transitions. [2018-12-09 08:05:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1668 transitions. [2018-12-09 08:05:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 08:05:12,468 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 08:05:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1310 states and 1689 transitions. [2018-12-09 08:05:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1689 transitions. [2018-12-09 08:05:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 08:05:14,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-09 08:05:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1314 states and 1695 transitions. [2018-12-09 08:05:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1695 transitions. [2018-12-09 08:05:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 08:05:14,608 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-09 08:05:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1323 states and 1705 transitions. [2018-12-09 08:05:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1705 transitions. [2018-12-09 08:05:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 08:05:14,895 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 08:05:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1327 states and 1716 transitions. [2018-12-09 08:05:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1716 transitions. [2018-12-09 08:05:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 08:05:16,872 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1357 states and 1753 transitions. [2018-12-09 08:05:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1753 transitions. [2018-12-09 08:05:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 08:05:26,666 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-09 08:05:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1388 states and 1791 transitions. [2018-12-09 08:05:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1791 transitions. [2018-12-09 08:05:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 08:05:28,404 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-09 08:05:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1404 states and 1815 transitions. [2018-12-09 08:05:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1815 transitions. [2018-12-09 08:05:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 08:05:31,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-09 08:05:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1410 states and 1821 transitions. [2018-12-09 08:05:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1821 transitions. [2018-12-09 08:05:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 08:05:31,734 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 08:05:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1413 states and 1828 transitions. [2018-12-09 08:05:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1828 transitions. [2018-12-09 08:05:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 08:05:32,345 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 08:05:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1417 states and 1833 transitions. [2018-12-09 08:05:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1833 transitions. [2018-12-09 08:05:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 08:05:32,851 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 08:05:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1418 states and 1833 transitions. [2018-12-09 08:05:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1833 transitions. [2018-12-09 08:05:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 08:05:33,220 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 08:05:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1431 states and 1846 transitions. [2018-12-09 08:05:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1846 transitions. [2018-12-09 08:05:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 08:05:34,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 08:05:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1440 states and 1858 transitions. [2018-12-09 08:05:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1858 transitions. [2018-12-09 08:05:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 08:05:36,400 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 08:05:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1444 states and 1862 transitions. [2018-12-09 08:05:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1862 transitions. [2018-12-09 08:05:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 08:05:37,391 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1474 states and 1898 transitions. [2018-12-09 08:05:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1898 transitions. [2018-12-09 08:05:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 08:05:38,584 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:44,340 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-09 08:05:46,951 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-09 08:05:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1525 states and 1953 transitions. [2018-12-09 08:05:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1953 transitions. [2018-12-09 08:05:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 08:05:47,945 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1529 states and 1960 transitions. [2018-12-09 08:05:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1960 transitions. [2018-12-09 08:05:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 08:05:48,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:05:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1540 states and 1975 transitions. [2018-12-09 08:05:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1975 transitions. [2018-12-09 08:05:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 08:05:50,591 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:05:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 1616 states and 2058 transitions. [2018-12-09 08:05:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2058 transitions. [2018-12-09 08:05:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 08:05:54,090 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:05:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:05:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1627 states and 2074 transitions. [2018-12-09 08:05:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2074 transitions. [2018-12-09 08:05:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 08:05:57,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:05:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:05:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:06:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1644 states and 2097 transitions. [2018-12-09 08:06:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2097 transitions. [2018-12-09 08:06:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 08:06:00,083 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:06:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1649 states and 2102 transitions. [2018-12-09 08:06:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2102 transitions. [2018-12-09 08:06:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 08:06:00,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:06:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 1651 states and 2104 transitions. [2018-12-09 08:06:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2104 transitions. [2018-12-09 08:06:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 08:06:01,228 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:06:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 1656 states and 2110 transitions. [2018-12-09 08:06:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2110 transitions. [2018-12-09 08:06:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 08:06:02,230 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 08:06:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 1660 states and 2115 transitions. [2018-12-09 08:06:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2115 transitions. [2018-12-09 08:06:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 08:06:02,820 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 08:06:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 1664 states and 2124 transitions. [2018-12-09 08:06:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2124 transitions. [2018-12-09 08:06:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 08:06:03,305 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:06:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 1704 states and 2167 transitions. [2018-12-09 08:06:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2167 transitions. [2018-12-09 08:06:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 08:06:07,346 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 08:06:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 1774 states and 2238 transitions. [2018-12-09 08:06:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2238 transitions. [2018-12-09 08:06:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 08:06:11,111 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 08:06:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 1775 states and 2238 transitions. [2018-12-09 08:06:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2238 transitions. [2018-12-09 08:06:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 08:06:11,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 08:06:15,955 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-09 08:06:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1823 states and 2286 transitions. [2018-12-09 08:06:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2286 transitions. [2018-12-09 08:06:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 08:06:19,476 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:06:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 1842 states and 2308 transitions. [2018-12-09 08:06:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2308 transitions. [2018-12-09 08:06:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 08:06:23,366 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:06:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 1906 states and 2375 transitions. [2018-12-09 08:06:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2375 transitions. [2018-12-09 08:06:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 08:06:30,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 08:06:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 1976 states and 2451 transitions. [2018-12-09 08:06:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2451 transitions. [2018-12-09 08:06:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 08:06:31,726 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-09 08:06:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2047 states and 2534 transitions. [2018-12-09 08:06:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2534 transitions. [2018-12-09 08:06:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 08:06:40,380 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-09 08:06:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2087 states and 2575 transitions. [2018-12-09 08:06:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2575 transitions. [2018-12-09 08:06:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 08:06:43,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-09 08:06:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2107 states and 2598 transitions. [2018-12-09 08:06:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2598 transitions. [2018-12-09 08:06:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 08:06:46,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-09 08:06:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2108 states and 2598 transitions. [2018-12-09 08:06:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2598 transitions. [2018-12-09 08:06:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-09 08:06:48,395 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:06:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:06:51,066 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-09 08:06:54,832 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-09 08:06:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:06:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2133 states and 2625 transitions. [2018-12-09 08:06:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2625 transitions. [2018-12-09 08:06:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-09 08:06:59,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:06:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 08:07:04,747 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-09 08:07:07,480 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-09 08:07:09,362 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-09 08:07:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2161 states and 2654 transitions. [2018-12-09 08:07:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2654 transitions. [2018-12-09 08:07:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-09 08:07:11,244 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 08:07:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2167 states and 2658 transitions. [2018-12-09 08:07:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2658 transitions. [2018-12-09 08:07:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 08:07:12,471 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 08:07:15,750 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-09 08:07:18,197 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-09 08:07:21,031 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-09 08:07:24,520 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-09 08:07:25,364 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-09 08:07:25,756 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-09 08:07:28,623 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-12-09 08:07:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2219 states and 2712 transitions. [2018-12-09 08:07:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2712 transitions. [2018-12-09 08:07:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 08:07:30,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 08:07:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2227 states and 2720 transitions. [2018-12-09 08:07:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2720 transitions. [2018-12-09 08:07:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 08:07:31,593 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 08:07:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2232 states and 2724 transitions. [2018-12-09 08:07:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2724 transitions. [2018-12-09 08:07:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 08:07:31,924 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-12-09 08:07:33,685 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-09 08:07:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2274 states and 2769 transitions. [2018-12-09 08:07:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2769 transitions. [2018-12-09 08:07:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 08:07:38,122 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 08:07:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2278 states and 2776 transitions. [2018-12-09 08:07:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2776 transitions. [2018-12-09 08:07:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 08:07:38,224 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 08:07:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2281 states and 2777 transitions. [2018-12-09 08:07:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2777 transitions. [2018-12-09 08:07:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 08:07:38,974 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 08:07:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2282 states and 2777 transitions. [2018-12-09 08:07:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2777 transitions. [2018-12-09 08:07:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 08:07:39,339 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 08:07:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2283 states and 2777 transitions. [2018-12-09 08:07:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2777 transitions. [2018-12-09 08:07:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-09 08:07:39,648 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 7 proven. 214 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-09 08:07:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2288 states and 2783 transitions. [2018-12-09 08:07:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2783 transitions. [2018-12-09 08:07:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-09 08:07:40,124 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 08:07:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2293 states and 2793 transitions. [2018-12-09 08:07:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2793 transitions. [2018-12-09 08:07:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 08:07:41,421 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:07:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 338 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:07:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 08:07:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2275 states and 2774 transitions. [2018-12-09 08:07:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2774 transitions. [2018-12-09 08:07:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-09 08:07:43,634 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 08:07:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:07:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:07:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:07:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:07:43,814 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 143 iterations. [2018-12-09 08:07:43,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 08:07:43 ImpRootNode [2018-12-09 08:07:43,925 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 08:07:43,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:07:43,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:07:43,926 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:07:43,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:04:02" (3/4) ... [2018-12-09 08:07:43,928 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 08:07:44,027 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_09522bd9-5b9c-4555-9a45-d77a53ccc41c/bin-2019/ukojak/witness.graphml [2018-12-09 08:07:44,027 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:07:44,028 INFO L168 Benchmark]: Toolchain (without parser) took 223449.47 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 945.2 MB in the beginning and 779.8 MB in the end (delta: 165.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 08:07:44,028 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:07:44,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-12-09 08:07:44,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:07:44,029 INFO L168 Benchmark]: Boogie Preprocessor took 40.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:07:44,029 INFO L168 Benchmark]: RCFGBuilder took 1005.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 884.9 MB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. [2018-12-09 08:07:44,029 INFO L168 Benchmark]: CodeCheck took 221902.57 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 956.8 MB). Free memory was 884.9 MB in the beginning and 823.7 MB in the end (delta: 61.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 08:07:44,029 INFO L168 Benchmark]: Witness Printer took 101.66 ms. Allocated memory is still 2.1 GB. Free memory was 823.7 MB in the beginning and 779.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-09 08:07:44,030 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 221.7s OverallTime, 143 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 444076056 SDtfs, 194199064 SDslu, -1632612208 SDs, 0 SdLazy, -409451182 SolverSat, -729205326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 467.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141260 GetRequests, 136816 SyntacticMatches, 2830 SemanticMatches, 1614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912073 ImplicationChecksByTransitivity, 202.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 20224 NumberOfCodeBlocks, 20224 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 19819 ConstructedInterpolants, 0 QuantifiedInterpolants, 15148935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 142 InterpolantComputations, 117 PerfectInterpolantSequences, 13779/14447 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: 410]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L366] a21 = 1 [L367] a7 = 0 [L368] a17 = 0 [L369] a8 = 14 [L370] a20 = 0 [L371] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [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))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] 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=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1005.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 884.9 MB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. * CodeCheck took 221902.57 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 956.8 MB). Free memory was 884.9 MB in the beginning and 823.7 MB in the end (delta: 61.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 101.66 ms. Allocated memory is still 2.1 GB. Free memory was 823.7 MB in the beginning and 779.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...